Structure-preserving symmetry presolving for mixed-binary linear problems

DOI10.1007/978-3-032-28691-8_30MaRDI QIDQ7349475zbMATH OpenFDO

Authors Annika Jäger, Marc Emanuel Pfetsch

Publication date 16 September 2026

Full work available at URL https://doi.org/10.1007/978-3-032-28691-8_30

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites work

• A computational comparison of symmetry handling methods for mixed integer programs
• Approximation algorithms for covering/packing integer programs
• Branch-cut-and-propagate for the maximum k-colorable subgraph problem with symmetry
• CliSAT: a new exact algorithm for hard maximum clique problems
• Exploiting orbits in symmetric ILP
• Fundamental Domains for Integer Programs with Symmetries
• Improved static symmetry breaking for SAT
• Modified orbital branching for structured symmetry with an application to unit commitment
• On the geometry of symmetry breaking inequalities
• On the geometry of symmetry breaking inequalities
• Orbital branching
• Orbitopal fixing
• Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
• Packing and partitioning orbitopes
• Packing, partitioning, and covering symresacks
• Polytopes associated with symmetry handling
• Pruning by isomorphism in branch-and-cut
• Satsuma: structure-based symmetry breaking in SAT
• Small covering designs by branch-and-cut
• Stabilizer-based symmetry breaking constraints for mathematical programs
• Symmetry breaking inequalities from the Schreier-Sims table
• Symmetry in integer linear programming

This page was built for publication: Structure-preserving symmetry presolving for mixed-binary linear problems

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