Iterated tabu search for the circular open dimension problem
Authors:
- Zhanghua FuZFZhanghua Fu
- Wenqi HuangWHWenqi Huang
- Zhipeng LüZLZhipeng Lü
- 1 March 2013
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 225 (2) , 236-243
Abstract
No abstract availableKeywords
All Related Versions
This publication has 37 references indexed in Scilit:
- Packing circles in the smallest circle: an adaptive hybrid algorithmJournal of the Operational Research Society, 2011
- An augmented beam search-based algorithm for the circular open dimension problemComputers & Industrial Engineering, 2011
- Adaptive beam search lookahead algorithms for the circular packing problemInternational Transactions in Operational Research, 2010
- A beam search algorithm for the circular packing problemComputers & Operations Research, 2009
- Disk Packing in a Square: A New Global Optimization ApproachINFORMS Journal on Computing, 2008
- Algorithms for the circular two‐dimensional open dimension problemInternational Transactions in Operational Research, 2008
- Efficiently packing unequal disks in a circleOperations Research Letters, 2008
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approachEuropean Journal of Operational Research, 2005
- Optimization of indoor wireless communication network layoutsIIE Transactions, 2002
- Improving Dense Packings of Equal Disks in a SquareThe Electronic Journal of Combinatorics, 2000