Symbolic Constraints

At the moment the following symbolic constraints are in the library.

• SCIL::CUT: Cuts in undirected graphs
• SCIL::KCONNECTED: k-edge-connected subgraphs
• SCIL::MAX: weighted maximum of binary variables
• SCIL::STABLESET: Stable sets in undirected graphs
• SCIL::MATCHING: b-matchings in undirected graphs
• SCIL::TOUR: Hamiltonian Cycles in undirected graphs.
• SCIL::ATOUR: Hamiltonian Cycles in directed graphs.
• SCIL::FLOW: Network Flows.
• SCIL::SpanTree: Spanning Trees.
• SCIL::StronglyConnected: Strongly Connected Subgraphs.
• SCIL::PATH: Paths between pairs of nodes.
• SCIL::SteinerArborescence: Steiner arboescences in directed graphs
• SCIL::TJOIN: T-Joins in undirected Graphs