Fundamental Domains for Integer Programs with Symmetries

From MaRDI portal
Publication:3611965

DOI10.1007/978-3-540-73556-4_17zbMath1175.90296OpenAlexW1540408143MaRDI QIDQ3611965

Eric J. Friedman

Publication date: 3 March 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-73556-4_17




Related Items

Exploiting symmetries in mathematical programming via orbital independenceSymmetry in Mathematical ProgrammingEquivalence of Lattice Orbit PolytopesLexicographical order in integer programmingPolytopes associated with symmetry handlingOrbitopal fixingPacking, partitioning, and covering symresacksVariable symmetry breaking in numerical constraint problemsSymmetry-breaking inequalities for ILP with structured sub-symmetryAlgorithms for highly symmetric linear and integer programsAn efficient global algorithm for indefinite separable quadratic knapsack problems with box constraintsA fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parametersA semidefinite relaxation based global algorithm for two-level graph partition problemExploiting symmetry in integer convex optimization using core pointsOrbitopal fixing for the full (sub-)orbitope and application to the unit commitment problemReformulations in mathematical programming: automatic symmetry detection and exploitationThe maximum \(k\)-colorable subgraph problem and orbitopesA computational comparison of symmetry handling methods for mixed integer programsOn the geometry of symmetry breaking inequalitiesOn the geometry of symmetry breaking inequalitiesExploiting Symmetries in Polyhedral ComputationsFundamental Domains for Symmetric Optimization: Construction and SearchAutomatic Generation of Symmetry-Breaking ConstraintsModified orbital branching for structured symmetry with an application to unit commitment