The symbolic constraint for undirected Hamiltonian cycles. More...
Public Member Functions
|TOUR (Graph &G_, var_map< edge_descriptor > &X)|
|void||init (subproblem &S)|
|status||standard_separation (subproblem &S)|
|status||fast_separation (subproblem &S)|
|status||feasible (solution &S)|
This symbolic constraints takes as arguments an undirected
G and a
X has to map every edge of the graph to a binary variable.
The feasible assignments of the symbolic constraint are those where the vector of the variables associated with the edges of the graph is an incidence-vector of a Hamiltonian cycle.
The symbolic constraint uses the cutting plane method, based on the well known subtour elimination formulation of Hamiltonian cycles.
|TOUR< Graph >::status TOUR::fast_separation||(||subproblem &||S||)||
|void TOUR::init||(||subproblem &||S||)||
|TOUR< Graph >::status TOUR::standard_separation||(||subproblem &||S||)||