Formulation symmetries in circle packing
From MaRDI portal
Publication:2861569
Recommendations
- On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Symmetry in mathematical programming
- Formulation Space Search for Circle Packing Problems
- Variable neighborhood formulation space search for circle packing
Cites work
- scientific article; zbMATH DE number 3823850 (Why is no real title available?)
- scientific article; zbMATH DE number 50758 (Why is no real title available?)
- scientific article; zbMATH DE number 1142321 (Why is no real title available?)
- scientific article; zbMATH DE number 863496 (Why is no real title available?)
- Automatic Generation of Symmetry-Breaking Constraints
- Branching and bounds tighteningtechniques for non-convex MINLP
- New formulations for the Kissing Number Problem
- Packing equal circles in a square: A deterministic global optimization approach
- Recent Advances in Constraints
- Reformulations in Mathematical Programming: Definitions and Systematics
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Symmetry in integer linear programming
Cited in
(9)- Exploiting symmetries in mathematical programming via orbital independence
- scientific article; zbMATH DE number 5046178 (Why is no real title available?)
- Orbital independence in symmetric mathematical programs
- A multiplicative weights update algorithm for MINLP
- Variable symmetry breaking in numerical constraint problems
- Packing unit spheres into a cube using VNS
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Symmetry in mathematical programming
- The invariant cubic rod (cylinder) packings: symmetries and coordinates
This page was built for publication: Formulation symmetries in circle packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2861569)
