A novel non-linear approach to minimal area rectangular packing
- 5 November 2008
- journal article
- Published by Springer Nature in Annals of Operations Research
- Vol. 179 (1) , 243-260
Abstract
No abstract availableKeywords
This publication has 32 references indexed in Scilit:
- Multi-dimensional bin packing problems with guillotine constraintsComputers & Operations Research, 2010
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimizationComputers & Operations Research, 2006
- A simulated annealing approach to the traveling tournament problemJournal of Scheduling, 2006
- Placement and Routing in 3D Integrated CircuitsIEEE Design & Test of Computers, 2005
- Metaheuristics in combinatorial optimizationACM Computing Surveys, 2003
- A direct search variant of the simulated annealing algorithm for optimization involving continuous variablesComputers & Operations Research, 2002
- A penalized Fischer-Burmeister NCP-functionMathematical Programming, 2000
- A non–interior predictor–corrector path following algorithm for the monotone linear complementarity problemMathematical Programming, 2000
- B*-Trees2000
- Model and solution strategy for placement of rectangular blocks in the Euclidean planeIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1988