Optimal algorithm for rectangle placement

Operations Research Letters

Volumn 24, Issue 1, 1999, Pages 73-80

  Healy, Patrick ^a   Creavin, Marcus ^a   Kuusik, Ago ^a  

^a UNIVERSITY OF LIMERICK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INTEGRATED CIRCUIT LAYOUT; ITERATIVE METHODS; VLSI CIRCUITS;

RECTANGLE PLACEMENT METHOD; TWO-DIMENSIONAL KNAPSACK PROCESS;

OPTIMIZATION;

EID: 0032673001     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(98)00048-0     Document Type: Article

References (8)

1. A. Aggarwal, S. Suri, Fast algorithms for computing the largest empty rectangle, in: Proc. 3rd Annu. ACM Symp. Comput. Geom., 1987, pp. 278-290.
2. B. Chazelle, The bottom-left bin-packing heuristic: an efficient implementation, IEEE Trans. Comput. C-32 (8) (1983) 697-707.
3. Datta A. Efficient algorithms for the largest rectangle problem. Inform. Sci. 64:1992;121-141.
4. Dowsland K.A. Some experiments with simulated annealing techniques for packing problems. European J. Oper. Res. 68:1993;389-399.
5. P. Healy, Rule-based local search in rectangle layout, Master's thesis, University of Massachusetts, Amherst, May 1988.
6. Healy P., Moll R.N. A local optimization-based solution to the rectangle layout problem. J. Oper. Res. Soc. 47:1996;523-537.
7. Orlowski M. A new algorithm for the largest empty rectangle problem. Algorithmica. 5:1990;65-73.
8. F.P. Preparata, M.I. Shamos, Computational Geometry: An Introduction, Springer, New York, 1985.