Symmetries in binary programs. A polyhedral perspective

MaRDI QIDQ4617583zbMATH OpenFDO

Authors Christopher Hojny

Publication date 6 February 2019

zbMATH Keywords

$k$-star colorable subgraph problembranch-and-bound algorithminteger programssymmetry breaking polytopesymmetry handling inequalities

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Coloring of graphs and hypergraphs (05C15) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10)

Recommendations

• Polytopes associated with symmetry handling
• Symmetry in integer linear programming
• A computational comparison of symmetry handling methods for mixed integer programs
• Symmetric ILP: Coloring and small integers
• Sub-symmetry-breaking inequalities for ILP with structured symmetry

Cited in

(6)

• Packing, partitioning, and covering symresacks
• Parity polytopes and binarization
• Polytopes associated with symmetry handling
• Symmetric ILP: Coloring and small integers
• Polynomial size IP formulations of knapsack may require exponentially large coefficients
• Knapsack polytopes: a survey

Describes a project that uses

Uses Software

• SCIP

This page was built for publication: Symmetries in binary programs. A polyhedral perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4617583)