Exploiting symmetry in integer convex optimization using core points

DOI10.1016/j.orl.2013.02.007zbMath1286.90097arXiv1202.0435OpenAlexW2136389256MaRDI QIDQ2450624

Thomas Rehn, Katrin Herr, Achill Schürmann

Publication date: 14 May 2014

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1202.0435

zbMATH Keywords

symmetryinteger linear programscore setcore pointinteger convex optimization

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10)

Related Items

Equivalence of Lattice Orbit Polytopes, Polytopes associated with symmetry handling, A computational comparison of symmetry handling methods for mixed integer programs, On lattice-free orbit polytopes, Orbital shrinking: theory and applications, On the geometry of symmetry breaking inequalities, On the geometry of symmetry breaking inequalities, Exploiting Symmetries in Polyhedral Computations

Uses Software

• Normaliz
• polymake
• SCIP
• MIPLIB
• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Orbital branching
• Geometry, complexity, and combinatorics of permutation polytopes
• SCIP: solving constraint integer programs
• Packing and partitioning orbitopes
• Exploiting orbits in symmetric ILP
• A computational comparison of symmetry handling methods for mixed integer programs
• Symmetry groups, semidefinite programs, and sums of squares
• Algorithms for highly symmetric linear and integer programs
• Classification of orthogonal arrays by integer programming
• Invariant Semidefinite Programs
• Symmetry in Mathematical Programming
• Improving Bounds on the Football Pool Problem by Integer Programming and High-Throughput Computing
• On the Volume of Lattice Polyhedra
• Fundamental Domains for Integer Programs with Symmetries