A computational comparison of symmetry handling methods for mixed integer programs
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2165490 (Why is no real title available?)
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- Algorithms for highly symmetric linear and integer programs
- Automatic Detection of Variable and Value Symmetries
- Automatic Generation of Symmetry-Breaking Constraints
- Computing symmetry groups of polyhedra
- Conflict analysis in mixed integer programming
- Conflict graphs in solving integer programming problems
- Core sets and symmetric convex optimization
- Detecting orbitopal symmetries
- Exploiting orbits in symmetric ILP
- Exploiting symmetry in integer convex optimization using core points
- Extended formulations for packing and partitioning orbitopes
- Facets and rank of integer polyhedra
- Fundamental Domains for Integer Programs with Symmetries
- Improving Discrete Model Representations via Symmetry Considerations
- MIPLIB 2003
- On lattice-free orbit polytopes
- On solving a hard quadratic 3-dimensional assignment problem
- Orbital Branching
- Orbital Shrinking: A New Tool for Hybrid MIP/CP Methods
- Orbital branching
- Orbital shrinking
- Orbitopal fixing
- Packing and partitioning orbitopes
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Pruning by isomorphism in branch-and-cut
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- SCIP: solving constraint integer programs
- Small covering designs by branch-and-cut
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Symmetric ILP: Coloring and small integers
- Symmetry groups, semidefinite programs, and sums of squares
- The NP-completeness column
- The graph isomorphism disease
Cited in
(16)- Exploiting symmetries in mathematical programming via orbital independence
- Exploiting symmetry for the job sequencing and tool switching problem
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
- Symmetries in binary programs. A polyhedral perspective
- Equivalence of lattice orbit polytopes
- Integer programming for classifying orthogonal arrays
- Exploiting symmetry in integer convex optimization using core points
- Polytopes associated with symmetry handling
- Optimal Dorfman group testing for symmetric distributions
- Finding Symmetry Groups of Some Quadratic Programming Problems
- On the geometry of symmetry breaking inequalities
- Presolve Reductions in Mixed Integer Programming
- Fundamental domains for symmetric optimization: construction and search
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
- Handling symmetries in mixed-integer semidefinite programs
- Political districting to minimize cut edges
This page was built for publication: A computational comparison of symmetry handling methods for mixed integer programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1741126)
