Fundamental Domains for Integer Programs with Symmetries
From MaRDI portal
Recommendations
Cited in
(32)- A computational comparison of symmetry handling methods for mixed integer programs
- Algorithms for highly symmetric linear and integer programs
- Packing, partitioning, and covering symresacks
- Symmetry-breaking inequalities for ILP with structured sub-symmetry
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
- Modified orbital branching for structured symmetry with an application to unit commitment
- Lexicographical order in integer programming
- Polytopes associated with symmetry handling
- Exploiting symmetry in integer convex optimization using core points
- 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
- Computing symmetry groups of polyhedra
- Exploiting symmetries in polyhedral computations
- Symmetry in mathematical programming
- Orbitopal fixing
- Equivalence of lattice orbit polytopes
- Fundamental domains for symmetric optimization: construction and search
- Automatic Generation of Symmetry-Breaking Constraints
- On the geometry of symmetry breaking inequalities
- On the geometry of symmetry breaking inequalities
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- The maximum k-colorable subgraph problem and orbitopes
- Handling sub-symmetry in integer programming using activation handlers
- A unified framework for symmetry handling
- Symmetry detection in mixed-integer conic programming
- Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond
- Reformulations of separable quadratic optimization problems with symmetric structures via variable aggregation
- Exploiting symmetries in optimal quantum circuit design
- Structure-preserving symmetry presolving for mixed-binary linear problems
- Exploiting symmetries in mathematical programming via orbital independence
- Variable symmetry breaking in numerical constraint problems
This page was built for publication: Fundamental Domains for Integer Programs with Symmetries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3611965)
