On the geometry of symmetry breaking inequalities
From MaRDI portal
Publication:5925642
DOI10.1007/s10107-022-01819-2OpenAlexW3100009539MaRDI QIDQ5925642
José Verschae, Matías Villagra, Léonard von Niederhäusern
Publication date: 14 March 2023
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-022-01819-2
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Symmetry properties of polytopes (52B15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Orbital branching
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Exploiting symmetries in mathematical programming via orbital independence
- Packing and partitioning orbitopes
- Pruning by isomorphism in branch-and-cut
- Exploiting orbits in symmetric ILP
- Symmetry breaking inequalities from the Schreier-Sims table
- A computational comparison of symmetry handling methods for mixed integer programs
- Recognizing finite matrix groups over infinite fields.
- Algorithms for highly symmetric linear and integer programs
- Polytopes associated with symmetry handling
- Exploiting symmetry in integer convex optimization using core points
- Generating effective symmetry-breaking predicates for search problems
- Exploiting Symmetries in Polyhedral Computations
- Improving Discrete Model Representations via Symmetry Considerations
- Extended Formulations for Packing and Partitioning Orbitopes
- Symmetry in Integer Linear Programming
- Fundamental Domains for Integer Programs with Symmetries
- Fundamental Domains for Symmetric Optimization: Construction and Search
- Foundations of Hyperbolic Manifolds
- Mixed Integer Programming: Analyzing 12 Years of Progress
- Graph isomorphism in quasipolynomial time [extended abstract]
- On the geometry of symmetry breaking inequalities
