Orbital Independence in Symmetric Mathematical Programs

DOI10.1007/978-3-319-26626-8_34zbMath1478.90096OpenAlexW2408750873MaRDI QIDQ3467864

Leo Liberti, Gustavo Fruet Dias

Publication date: 5 February 2016

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

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_34

zbMATH Keywords

branch-and-boundglobal optimality``break symmetriesseparate orbits

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)

Related Items

Exploiting symmetries in mathematical programming via orbital independence, Polytopes associated with symmetry handling

Uses Software

• GAP
• nauty
• AMPL
• CPLEX
• Traces
• ROSE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stabilizer-based symmetry breaking constraints for mathematical programs
• Orbital branching
• Reformulations in mathematical programming: automatic symmetry detection and exploitation
• Packing and partitioning orbitopes
• Pruning by isomorphism in branch-and-cut
• Exploiting orbits in symmetric ILP
• Practical graph isomorphism. II.
• Symmetry in Mathematical Programming
• Constraint Orbital Branching
• Symmetry in Integer Linear Programming
• Reformulations in Mathematical Programming: Definitions and Systematics
• The Reformulation-Optimization Software Engine