On tackling reverse convex constraints for non-overlapping of unequal circles
From MaRDI portal
(Redirected from Publication:2045013)
Recommendations
- On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
- Cutting circles and polygons from area-minimizing rectangles
- A mathematical model and a solution method of the packing problem of maximal number of equal circles into a non-convex region with prohibited areas
- Efficiently packing unequal disks in a circle
- scientific article; zbMATH DE number 2185524
Cites work
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 2068080 (Why is no real title available?)
- A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
- A customized branch-and-bound approach for irregular shape nesting
- A fully general, exact algorithm for nesting irregular shapes
- A heuristic for the circle packing problem with a variety of containers
- A literature review on circle and sphere packing problems: models and methodologies
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- A polyhedral branch-and-cut approach to global optimization
- A reliable area reduction technique for solving circle packing problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Benchmarking optimization software with performance profiles.
- Branching and bounds tighteningtechniques for non-convex MINLP
- Computational geometry. Algorithms and applications.
- Computing tight bounds via piecewise linear functions through the example of circle cutting problems
- Domain reduction techniques for global NLP and MINLP optimization
- Global Optimization in Geometry — Circle Packing into the Square
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Intersection cuts for factorable MINLP
- Interval methods for verifying structural optimality of circle packing configurations in the unit square
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- On convex relaxations for quadratically constrained quadratic programming
- On the use of intersection cuts for bilevel optimization
- Outer-product-free sets for polynomial optimization and oracle-based cuts
- Packing equal circles in a square: A deterministic global optimization approach
- Presolve Reductions in Mixed Integer Programming
- Reactive GRASP for the strip-packing problem
- Reverse convex programming
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- SCIP: solving constraint integer programs
- Solving circle packing problems by global optimization: numerical results and industrial applications
This page was built for publication: On tackling reverse convex constraints for non-overlapping of unequal circles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2045013)
