Stabilizer-based symmetry breaking constraints for mathematical programs
From MaRDI portal
(Redirected from Publication:486387)
Recommendations
Cites work
- scientific article; zbMATH DE number 1849958 (Why is no real title available?)
- Automatic Generation of Symmetry-Breaking Constraints
- Branching and bounds tighteningtechniques for non-convex MINLP
- Formulation symmetries in circle packing
- Improving Discrete Model Representations via Symmetry Considerations
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- MIPLIB2003
- Orbital branching
- Pruning by isomorphism in branch-and-cut
- Reformulations in Mathematical Programming: Definitions and Systematics
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Symmetry in mathematical programming
- The reformulation-optimization software engine
- Three Ideas for the Quadratic Assignment Problem
Cited in
(19)- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
- Exploiting symmetries in mathematical programming via orbital independence
- Variable symmetry breaking in numerical constraint problems
- Symmetry-breaking inequalities for ILP with structured sub-symmetry
- Orbital shrinking: theory and applications
- Symmetry in mathematical programming
- A semidefinite relaxation based global algorithm for two-level graph partition problem
- Polytopes associated with symmetry handling
- Enabling research through the SCIP Optimization Suite 8.0
- Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
- Orbital independence in symmetric mathematical programs
- Efficient symmetry breaking formulations for the job grouping problem
- Automatic Generation of Symmetry-Breaking Constraints
- Symmetry breaking using stabilizers
- A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters
- On the geometry of symmetry breaking inequalities
- A computational comparison of symmetry handling methods for mixed integer programs
- On the geometry of symmetry breaking inequalities
This page was built for publication: Stabilizer-based symmetry breaking constraints for mathematical programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q486387)
