The circle packing problem: a theoretical comparison of various convexification techniques

DOI10.1016/J.ORL.2024.107197MaRDI QIDQ6988267zbMATH OpenFDO

Authors Aida Khajavirad

Publication date 5 May 2025

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ORL.2024.107197

zbMATH Keywords

Boolean quadric polytopecircle packing problemlinear programming relaxationsnon-overlapping constraintssemidefinite programming relaxations

Mathematics Subject Classification ID

Circle packings and discrete conformal geometry (52C26) Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Combinatorial optimization (90C27)

Cites work

• A hybrid LP/NLP paradigm for global optimization relaxations
• A New Verified Optimization Technique for the "Packing Circles in a Unit Square" Problems
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Geometry of cuts and metrics
• Global Optimization in Geometry — Circle Packing into the Square
• More optimal packings of equal circles in a square
• On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
• Packing equal circles in a square: A deterministic global optimization approach
• Semidefinite Programming
• Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
• Solving circle packing problems by global optimization: numerical results and industrial applications
• The Boolean quadratic polytope: Some characteristics, facets and relatives

Cited in

(3)

• Simultaneous convexification for the planar obnoxious facility location problem
• Detecting and handling reflection symmetries in mixed-integer (nonlinear) programming and beyond
• A framework for handling and exploiting symmetry in Benders decomposition

This page was built for publication: The circle packing problem: a theoretical comparison of various convexification techniques

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6988267)