On tackling reverse convex constraints for non-overlapping of unequal circles

DOI10.1007/s10898-020-00976-yzbMath1473.90133OpenAlexW3119374187MaRDI QIDQ2045013

Chrysanthos E. Gounaris, Akang Wang

Publication date: 11 August 2021

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-020-00976-y

zbMATH Keywords

circle packingbranching schemenon-overlapping constraintscircular open dimension problemfeasibility-based tighteningstrengthened intersection cuts

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Uses Software

• SCIP
• ANTIGONE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing tight bounds via piecewise linear functions through the example of circle cutting problems
• A literature review on circle and sphere packing problems: models and methodologies
• A heuristic for the circle packing problem with a variety of containers
• SCIP: solving constraint integer programs
• Interval methods for verifying structural optimality of circle packing configurations in the unit square
• Solving circle packing problems by global optimization: numerical results and industrial applications
• Reactive GRASP for the strip-packing problem
• Reverse convex programming
• Packing equal circles in a square: A deterministic global optimization approach
• A customized branch-and-bound approach for irregular shape nesting
• Domain reduction techniques for global NLP and MINLP optimization
• Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
• A polyhedral branch-and-cut approach to global optimization
• On the use of intersection cuts for bilevel optimization
• A mathematical model and a solution method for the problem of placing various-sized circles into a strip
• On convex relaxations for quadratically constrained quadratic programming
• Outer-product-free sets for polynomial optimization and oracle-based cuts
• A fully general, exact algorithm for nesting irregular shapes
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Intersection cuts for factorable MINLP
• A reliable area reduction technique for solving circle packing problems
• Presolve Reductions in Mixed Integer Programming
• Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
• Branching and bounds tighteningtechniques for non-convex MINLP
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
• A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
• Global Optimization in Geometry — Circle Packing into the Square
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming
• Benchmarking optimization software with performance profiles.

This page was built for publication: On tackling reverse convex constraints for non-overlapping of unequal circles