Packing and partitioning orbitopes

DOI10.1007/s10107-006-0081-5zbMath1171.90004arXivmath/0603678OpenAlexW2074723965MaRDI QIDQ925263

Publication date: 3 June 2008

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

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

zbMATH Keywords

Integer programming graph coloring Symmetry breaking Lexicographic representatives packing polytopes partitioning polytopes

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

Exploiting symmetries in mathematical programming via orbital independence, A polyhedral investigation of star colorings, Symmetry in Mathematical Programming, Convex hull characterizations of lexicographic orderings, Orbital Independence in Symmetric Mathematical Programs, Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs, Discrete optimization methods to fit piecewise affine models to data points, Equivalence of Lattice Orbit Polytopes, Lexicographical order in integer programming, A supernodal formulation of vertex colouring with applications in course timetabling, Matrices with lexicographically-ordered rows, Polytopes associated with symmetry handling, Spherical cuts for integer programming problems, On the combinatorics of the 2-class classification problem, A branch-and-cut algorithm for the connected max-\(k\)-cut problem, Optimization for Power Systems and the Smart Grid, Constraint Orbital Branching, Orbitopal fixing, Packing, partitioning, and covering symresacks, Orbital branching, Complexity, algorithmic, and computational aspects of a dial-a-ride type problem, Symmetry-breaking inequalities for ILP with structured sub-symmetry, Algorithms for highly symmetric linear and integer programs, Mixed-integer programming techniques for the minimum sum-of-squares clustering problem, An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints, Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches, A polyhedral approach for the equitable coloring problem, Employee workload balancing by graph partitioning, 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 Dantzig figures from graded lexicographic orders, Mixed-integer programming techniques for the connected max-\(k\)-cut problem, Extended formulations in combinatorial optimization, Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions, Extended formulations in combinatorial optimization, Strong IP formulations need large coefficients, Hard multidimensional multiple choice knapsack problems, an empirical study, 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, Political districting to minimize cut edges

Uses Software

PESPLib

Cites Work