Optimal rectangle packing: New results

Proceedings of the 14th International Conference on Automated Planning and Scheduling, ICAPS 2004

Volumn , Issue , 2004, Pages 142-149

  Korf, Richard E ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CUTTING-STOCK PROBLEMS; OPEN SQUARE-PACKING PROBLEMS; RECTANGLE PACKING; STOCK MATERIALS;

ALGORITHMS; COSTS; MATHEMATICAL MODELS; SCHEDULING; VLSI CIRCUITS;

PROBLEM SOLVING;

EID: 13444263964     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. Bitner, J., and Reingold, E. 1975. Backtrack programming techniques. Communications of the A.C.M. 18(11):655.
2. Gardner, M. 1966. Mathematical games: The problem of mrs. perkin's quilt and answers to last month's puzzles. Scientific American 215(3):264-272.
3. Gardner, M. 1975. The problem of mrs. perkin's quilt and other square-packing problems. In Mathematical Carnival. New York: Alfred A. Knopf. 139-149.
4. Korf, R. 2001. A new algorithm for optimal bin packing. In Proceedings of the National Conference on Artificial Intelligence (AAAI-02), 731-736. Edmonton, Alberta, Canada: AAAI Press.
5. Korf, R. 2003. Optimal rectangle packing: Initial results. In Proceedings of the Thirteenth International Conference on Automated Planning and Scheduling, (ICAPS 2003), 287-295. Trento, Italy: AAAI Press.
6. Martello, S., and Toth, P. 1990. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics 28:59-70.
7. Watson, G. 1918. Messenger of Mathematics, New Series 48:1-22.