Orbitopal fixing
From MaRDI portal
Publication:408377
DOI10.1016/j.disopt.2011.07.001zbMath1235.90091arXivmath/0611531OpenAlexW3037973199MaRDI QIDQ408377
Marc E. Pfetsch, Matthias Peinhardt, Volker Kaibel
Publication date: 5 April 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0611531
Related Items
An extended edge-representative formulation for the \(K\)-partitioning problem, Convex hull characterizations of lexicographic orderings, The Power of Optimization Over Randomization in Designing Experiments Involving Small Samples, Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables, Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs, Lexicographical order in integer programming, Exploiting sparsity for the min \(k\)-partition problem, Polytopes associated with symmetry handling, Optimization for Power Systems and the Smart Grid, The <scp>K‐partitioning</scp> problem: Formulations and <scp>branch‐and‐cut</scp>, Packing, partitioning, and covering symresacks, Complexity, algorithmic, and computational aspects of a dial-a-ride type problem, 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, An exact approach for the multi-constraint graph partitioning problem, Large-scale unit commitment under uncertainty: an updated literature survey, Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem, A computational comparison of symmetry handling methods for mixed integer programs, A two-level graph partitioning problem arising in mobile wireless communications, Mixed-integer programming techniques for the connected max-\(k\)-cut problem, Improved compact formulations for a wide class of graph partitioning problems in sparse graphs, Projection results for the \(k\)-partition problem, Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions, Modified orbital branching for structured symmetry with an application to unit commitment, Political districting to minimize cut edges
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Orbital branching
- A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem
- SCIP: solving constraint integer programs
- Facets of the clique partitioning polytope
- Packing and partitioning orbitopes
- A cutting plane algorithm for a clustering problem
- Cliques and clustering: A combinatorial approach
- The node capacitated graph partitioning problem: A computational study
- A computational study of graph partitioning
- Pruning by isomorphism in branch-and-cut
- Small covering designs by branch-and-cut
- Exploiting orbits in symmetric ILP
- Symmetry breaking revisited
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- Facets of the \(k\)-partition polytope
- The partition problem
- Conflict analysis in mixed integer programming
- Symmetric ILP: Coloring and small integers
- Clustering of microarray data via clique partitioning
- Extended Formulations for Packing and Partitioning Orbitopes
- Constraint Orbital Branching
- Principles of Constraint Programming
- Symmetry in Integer Linear Programming
- Fundamental Domains for Integer Programs with Symmetries
- Orbitopal Fixing
