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

branching scheme circle packing non-overlapping constraints circular open dimension problem feasibility-based tightening strengthened intersection cuts

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Cites Work

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

Uses Software

SCIP
ANTIGONE

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)