A dynamic adaptive local search algorithm for the circular packing problem
Authors:
- M. HifiMHM. Hifi
- R. M’hAllahRMR. M’hAllah
- 1 December 2007
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 183 (3) , 1280-1294
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Reformulation descent applied to circle packing problemsComputers & Operations Research, 2005
- A simulated annealing approach for the circular cutting problemEuropean Journal of Operational Research, 2004
- Approximate algorithms for constrained circular cutting problemsComputers & Operations Research, 2004
- A hybrid algorithm for the two‐dimensional layout problem: the cases of regular and irregular shapesInternational Transactions in Operational Research, 2003
- Two-dimensional packing problems: A surveyEuropean Journal of Operational Research, 2002
- Dense packings of congruent circles in a circleDiscrete Mathematics, 1998
- Curved Hexagonal Packings of Equal Disks in a CircleDiscrete & Computational Geometry, 1997
- Cutting and packingEuropean Journal of Operational Research, 1995
- Packing different-sized circles into a rectangular containerEuropean Journal of Operational Research, 1995
- Optimising the palletisation of cylinders in casesOR Spectrum, 1991