Exploiting symmetries in mathematical programming via orbital independence
From MaRDI portal
(Redirected from Publication:829174)
Recommendations
Cites work
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 1142312 (Why is no real title available?)
- A computational comparison of symmetry handling methods for mixed integer programs
- Exploiting orbits in symmetric ILP
- Extended formulations for packing and partitioning orbitopes
- Formulation symmetries in circle packing
- Fundamental Domains for Integer Programs with Symmetries
- Orbital branching
- Orbital independence in symmetric mathematical programs
- Orbital shrinking
- Orbital shrinking: theory and applications
- Packing and partitioning orbitopes
- Practical graph isomorphism. II.
- Pruning by isomorphism in branch-and-cut
- Quadratic knapsack problems
- Reformulations in Mathematical Programming: Definitions and Systematics
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- SCIP: solving constraint integer programs
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Symmetry in mathematical programming
- The reformulation-optimization software engine
Cited in
(7)- Enabling research through the SCIP Optimization Suite 8.0
- Orbital independence in symmetric mathematical programs
- Orbital geometry and group majorisation in optimisation
- 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
- Stabilizer-based symmetry breaking constraints for mathematical programs
This page was built for publication: Exploiting symmetries in mathematical programming via orbital independence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q829174)