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)

zbMATH Keywords

semidefinite programming relaxationsBoolean quadric polytopenon-overlapping constraintslinear programming relaxationscircle packing problem

Mathematics Subject Classification ID

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

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)