Orbitopal Fixing

DOI10.1007/978-3-540-72792-7_7MaRDI QIDQ5429259zbMATH OpenOpenAlexFDO

Authors Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch

Publication date 29 November 2007

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-72792-7_7

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Orbitopal fixing
• Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
• Orbital branching
• Orbital Branching
• Exploiting orbits in symmetric ILP

Cited in

(15)

• Symmetry-breaking inequalities for ILP with structured sub-symmetry
• Constraint Orbital Branching
• Orbitopal fixing
• Elective course planning
• Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
• Using symmetry to optimize over the Sherali-Adams relaxation
• Detecting orbitopal symmetries
• Algorithmic aspects of using small instance relaxations in parallel branch-and-cut
• A supernodal formulation of vertex colouring with applications in course timetabling
• Orbital branching
• A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
• The maximum k-colorable subgraph problem and orbitopes
• Hard multidimensional multiple choice knapsack problems, an empirical study
• SCIP: solving constraint integer programs
• Packing and partitioning orbitopes

This page was built for publication: Orbitopal Fixing

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