Describing orbitopes by linear inequalities and projection based tools.

MaRDI QIDQ3224030zbMATH OpenFDO

Authors Andreas Loos

Publication date 12 March 2012

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Packing and partitioning orbitopes
• Geometry, complexity, and combinatorics of permutation polytopes
• Extended formulations for packing and partitioning orbitopes
• ORBITOPES
• scientific article; zbMATH DE number 16720

Cited in

(12)

• Strong IP formulations need large coefficients
• Packing, partitioning, and covering symresacks
• Symmetry-breaking inequalities for ILP with structured sub-symmetry
• Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
• Lexicographical order in integer programming
• Matrices with lexicographically-ordered rows
• Polytopes associated with symmetry handling
• Finding descriptions of polytopes via extended formulations and liftings
• Extended formulations for packing and partitioning orbitopes
• The dimension of an orbitope based on a solution to the Legendre pair problem
• Knapsack polytopes: a survey
• Packing and partitioning orbitopes

This page was built for publication: Describing orbitopes by linear inequalities and projection based tools.

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