SCIL Namespace Reference

The symbolic constraint for directed Hamiltonian cycles. More...

Compounds
class	column
	A column for the LP-Matrix.
class	cons
	Handle class for basic constraints.
class	cons_map
	Basic Constraint Maps.
class	cons_obj
class	ILP_Problem
class	row
	Rows.
class	solution
	The class that stores assignemnts from variables to values.
class	subproblem
class	sym_constraint
	Symbolic Constraints.
class	var
	Handle class for variables.
class	var_obj
	Variable Objects : The base class to derive variable-schema.
Functions
column	operator * (double d, cons c1)
	Creates the column .
column	operator * (double d, column c1)
	Creates the comlumn .
row	operator * (double d, var v)
	Creates the row .
row	operator * (double d, row r1)
	Creates the row .

---

Detailed Description

This symbolic constraints takes as arguments a directed graph G and a scil_map<edge> X. X has to map every edge of the graph to a binary variable.

The feasible assignments of the symbolic constraint are whose there the vector of the variables associated with the edges of the graph is an incidence-vector of a directed Hamiltonian cycle.

The symbolic constraint uses the cutting plane method, based on the well known subtour elimination formulation of directed Hamiltonian cycles.

---