Automatic Generation of Symmetry-Breaking Constraints

DOI10.1007/978-3-540-85097-7_31zbMath1168.90566OpenAlexW1579153838MaRDI QIDQ5505671

Leo Liberti

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_31

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items (9)

Symmetry in Mathematical Programming ⋮ Polytopes associated with symmetry handling ⋮ Reformulations in mathematical programming: automatic symmetry detection and exploitation ⋮ Stabilizer-based symmetry breaking constraints for mathematical programs ⋮ A computational comparison of symmetry handling methods for mixed integer programs ⋮ Unnamed Item ⋮ Orbital shrinking: theory and applications ⋮ Reformulations in Mathematical Programming: Definitions and Systematics ⋮ A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation

Uses Software

• GAP
• AMPL
• CPLEX
• MIPLIB2003

Cites Work

• Unnamed Item
• Packing and partitioning orbitopes
• Compact mathematical formulation for graph partitioning
• Editorial: Reformulation techniques in mathematical programming
• Pruning by isomorphism in branch-and-cut
• Small covering designs by branch-and-cut
• Exploiting orbits in symmetric ILP
• All-different polytopes
• Symmetric ILP: Coloring and small integers
• Some polyhedra related to combinatorial problems
• On a Binary-Encoded ILP Coloring Formulation
• Improving Discrete Model Representations via Symmetry Considerations
• Symmetry Definitions for Constraint Satisfaction Problems
• Fundamental Domains for Integer Programs with Symmetries
• Constructive Group Relaxations for Integer Programs
• Orbital Branching

This page was built for publication: Automatic Generation of Symmetry-Breaking Constraints