Handling sub-symmetry in integer programming using activation handlers

DOI10.1007/978-3-031-46826-1_8MaRDI QIDQ6899205zbMATH OpenFDO

Authors Christopher Hojny, Tom Verhoeff, Sten Wessel

Publication date 17 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-46826-1_8

Mathematics Subject Classification ID

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

Cites work

• A branch-and-bound algorithm for hard multiple knapsack problems
• A computational comparison of symmetry handling methods for mixed integer programs
• An exact algorithm for large multiple knapsack problems
• Automatic Generation of Symmetry-Breaking Constraints
• Exploiting orbits in symmetric ILP
• Fundamental Domains for Integer Programs with Symmetries
• scientific article; zbMATH DE number 3989108 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Orbital branching
• Orbital shrinking
• 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
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Stabilizer-based symmetry breaking constraints for mathematical programs
• Symmetry breaking inequalities from the Schreier-Sims table
• Symmetry in integer linear programming
• Symmetry-breaking inequalities for ILP with structured sub-symmetry

This page was built for publication: Handling sub-symmetry in integer programming using activation handlers

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