Orbitopal Fixing

DOI10.1007/978-3-540-72792-7_7zbMath1136.90407OpenAlexW2911404369MaRDI QIDQ5429259

Marc E. Pfetsch, Volker Kaibel, Matthias Peinhardt

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)

Related Items (12)

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

This page was built for publication: Orbitopal Fixing