At the moment the following symbolic constraints are in the library.
: Cuts in undirected graphs
: k-edge-connected subgraphs
: weighted maximum of binary variables
: Stable sets in undirected graphs
: b-matchings in undirected graphs
: Hamiltonian Cycles in undirected graphs.
: Hamiltonian Cycles in directed graphs.
: Network Flows.
: Spanning Trees.
: Strongly Connected Subgraphs.
: Paths between pairs of nodes.
: Steiner arboescences in directed graphs
: T-Joins in undirected Graphs
Generated on Mon Mar 28 22:03:51 2011 for SCIL by