Exact Methods for Recursive Circle Packing
From MaRDI portal
Publication:6283601
DOI10.1007/S10479-018-3115-5arXiv1702.07799WikidataQ128756246 ScholiaQ128756246MaRDI QIDQ6283601FDOQ6283601
Authors: Ambros M. Gleixner, Stephen J. Maher, Benjamin Müller, João Pedro Pedroso 
Publication date: 24 February 2017
Abstract: Packing rings into a minimum number of rectangles is an optimization problem which appears naturally in the logistics operations of the tube industry. It encompasses two major difficulties, namely the positioning of rings in rectangles and the recursive packing of rings into other rings. This problem is known as the Recursive Circle Packing Problem (RCPP). We present the first dedicated method for solving RCPP that provides strong dual bounds based on an exact Dantzig--Wolfe reformulation of a nonconvex mixed-integer nonlinear programming formulation. The key idea of this reformulation is to break symmetry on each recursion level by enumerating one-level packings, i.e., packings of circles into other circles, and by dynamically generating packings of circles into rectangles. We use column generation techniques to design a "price-and-verify" algorithm that solves this reformulation to global optimality. Extensive computational experiments on a large test set show that our method not only computes tight dual bounds, but often produces primal solutions better than those computed by heuristics from the literature.
Numerical methods in optimal control (49Mxx) Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)
This page was built for publication: Exact Methods for Recursive Circle Packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6283601)
