Stabilizer-based symmetry breaking constraints for mathematical programs
From MaRDI portal
Publication:486387
DOI10.1007/S10898-013-0106-6zbMATH Open1312.90077OpenAlexW2031906986MaRDI QIDQ486387FDOQ486387
Leo Liberti, James P. Ostrowski
Publication date: 15 January 2015
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0106-6
Recommendations
Cites Work
- MINLPLib -- a collection of test models for mixed-integer nonlinear programming
- MIPLIB2003
- Title not available (Why is that?)
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Orbital branching
- Branching and bounds tighteningtechniques for non-convex MINLP
- The Reformulation-Optimization Software Engine
- Symmetry in Mathematical Programming
- Improving Discrete Model Representations via Symmetry Considerations
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Reformulations in Mathematical Programming: Definitions and Systematics
- Three Ideas for the Quadratic Assignment Problem
- Pruning by isomorphism in branch-and-cut
- Formulation symmetries in circle packing
- Automatic Generation of Symmetry-Breaking Constraints
Cited In (14)
- Exploiting symmetries in mathematical programming via orbital independence
- Enabling research through the SCIP Optimization Suite 8.0
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
- A computational comparison of symmetry handling methods for mixed integer programs
- Orbital shrinking: theory and applications
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
- Polytopes associated with symmetry handling
- On the geometry of symmetry breaking inequalities
- On the geometry of symmetry breaking inequalities
- Variable symmetry breaking in numerical constraint problems
- Orbital Independence in Symmetric Mathematical Programs
- A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters
- Symmetry-breaking inequalities for ILP with structured sub-symmetry
- A semidefinite relaxation based global algorithm for two-level graph partition problem
Uses Software
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)
