Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond
From MaRDI portal
Cites work
- A computational comparison of symmetry handling methods for mixed integer programs
- A unified framework for symmetry handling
- Algorithms for highly symmetric linear and integer programs
- Automatic Detection of Variable and Value Symmetries
- Automatic Generation of Symmetry-Breaking Constraints
- Combinatorial optimization. Theory and algorithms
- Conflict propagation and component recursion for canonical labeling
- Detecting orbitopal symmetries
- Distributing many points on a sphere
- Efficient propagation techniques for handling cyclic symmetries in binary programs
- Exploiting orbits in symmetric ILP
- Fundamental Domains for Integer Programs with Symmetries
- Global Optimization in Geometry — Circle Packing into the Square
- Handbook of satisfiability. In 2 parts
- scientific article; zbMATH DE number 1881996 (Why is no real title available?)
- Measuring the impact of primal heuristics
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
- Mixed-integer nonlinear optimization
- On implementing symmetry detection
- On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Orbital branching
- Orbitopal fixing
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
- Packing and partitioning orbitopes
- Packing, partitioning, and covering symresacks
- Parallel Computation of Combinatorial Symmetries.
- Polynomial size IP formulations of knapsack may require exponentially large coefficients
- Polytopes associated with symmetry handling
- Practical graph isomorphism. II.
- Principles and practice of constraint programming -- CP 2002. 8th international conference, CP 2002, Ithaca, NY, USA, September 9--13, 2002. Proceedings.
- Principles and practice of constraint programming -- CP 2007. 13th international conference, CP 2007, Providence, RI, USA, September 23--27, 2007. Proceedings
- Principles and Practice of Constraint Programming – CP 2004
- Pruning by isomorphism in branch-and-cut
- Recent Advances in Constraints
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Symmetry breaking inequalities from the Schreier-Sims table
- Symmetry definitions for constraint satisfaction problems
- Symmetry in integer linear programming
- Symmetry in mathematical programming
- The circle packing problem: a theoretical comparison of various convexification techniques
- Unsolvability of some optimization problems
This page was built for publication: Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229380)
