Stabilizer-based symmetry breaking constraints for mathematical programs

DOI10.1007/s10898-013-0106-6zbMath1312.90077OpenAlexW2031906986MaRDI QIDQ486387

Leo Liberti, James 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

zbMATH Keywords

mathematical programmingMILPMINLPstatic symmetry breaking

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

Exploiting symmetries in mathematical programming via orbital independence, Orbital Independence in Symmetric Mathematical Programs, Polytopes associated with symmetry handling, Variable symmetry breaking in numerical constraint problems, Symmetry-breaking inequalities for ILP with structured sub-symmetry, An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints, A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters, A semidefinite relaxation based global algorithm for two-level graph partition problem, 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, On the geometry of symmetry breaking inequalities, On the geometry of symmetry breaking inequalities

Uses Software

• GAP
• nauty
• MIPLIB
• CPLEX
• GLOBALLib
• MINLPLib
• MIPLIB2003

Cites Work

• Unnamed Item
• Unnamed Item
• MIPLIB2003
• Orbital branching
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Pruning by isomorphism in branch-and-cut
• MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
• Symmetry in Mathematical Programming
• Improving Discrete Model Representations via Symmetry Considerations
• Three Ideas for the Quadratic Assignment Problem
• Branching and bounds tighteningtechniques for non-convex MINLP
• Reformulations in Mathematical Programming: Definitions and Systematics
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Automatic Generation of Symmetry-Breaking Constraints
• The Reformulation-Optimization Software Engine