Author:
Healy Patrick,Creavin Marcus,Kuusik Ago
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference8 articles.
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. Efficient algorithms for the largest rectangle problem;Datta;Inform. Sci.,1992
4. Some experiments with simulated annealing techniques for packing problems;Dowsland;European J. Oper. Res.,1993
5. P. Healy, Rule-based local search in rectangle layout, Master's thesis, University of Massachusetts, Amherst, May 1988.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献