Fundamental Domains for Integer Programs with Symmetries
From MaRDI portal
Publication:3611965
DOI10.1007/978-3-540-73556-4_17zbMath1175.90296OpenAlexW1540408143MaRDI QIDQ3611965
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 independence ⋮ Symmetry in Mathematical Programming ⋮ Equivalence of Lattice Orbit Polytopes ⋮ Lexicographical order in integer programming ⋮ Polytopes associated with symmetry handling ⋮ Orbitopal fixing ⋮ Packing, partitioning, and covering symresacks ⋮ Variable symmetry breaking in numerical constraint problems ⋮ Symmetry-breaking inequalities for ILP with structured sub-symmetry ⋮ Algorithms for highly symmetric linear and integer programs ⋮ 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 ⋮ Exploiting symmetry in integer convex optimization using core points ⋮ Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem ⋮ Reformulations in mathematical programming: automatic symmetry detection and exploitation ⋮ The maximum \(k\)-colorable subgraph problem and orbitopes ⋮ A computational comparison of symmetry handling methods for mixed integer programs ⋮ On the geometry of symmetry breaking inequalities ⋮ On the geometry of symmetry breaking inequalities ⋮ Exploiting Symmetries in Polyhedral Computations ⋮ Fundamental Domains for Symmetric Optimization: Construction and Search ⋮ Automatic Generation of Symmetry-Breaking Constraints ⋮ Modified orbital branching for structured symmetry with an application to unit commitment
