Optimal rectangle packing: An absolute placement approach

Journal of Artificial Intelligence Research

Volumn 46, Issue , 2013, Pages 47-87

  Huang, Eric ^a   Korf, Richard E ^b  

^a PALO ALTO RESEARCH CENTER   (United States)

^b Engineering IV   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PACKERS;

BOUNDING BOX; EMPTY SPACE; HIGH-PRECISION; ORDERS OF MAGNITUDE; PACKING PROBLEMS; RECTANGLE PACKING; STATE OF THE ART; SUBSET SUM;

GEOMETRY;

EID: 84875502071     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.3735     Document Type: Article

References (34)

1. Aggoun, A., & Beldiceanu, N. (1993). Extending chip in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling, 17(7), 57-73.
2. Beldiceanu, N., & Carlsson, M. (2001). Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In CP '01: Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, pp. 377-391, London, UK. Springer-Verlag.
3. Beldiceanu, N., Carlsson, M., & Poder, E. (2008). New filtering for the cumulative constraint in the context of non-overlapping rectangles. In Perron, L., & Trick, M. A. (Eds.), CPAIOR, Vol. 5015 of Lecture Notes in Computer Science, pp. 21-35. Springer.
4. Beldiceanu, N., Carlsson, M., Poder, E., Sadek, R., & Truchet, C. (2007). A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects. In Bessiere, C. (Ed.), CP, Vol. 4741 of Lecture Notes in Computer Science, pp. 180-194. Springer.
5. Bhattacharya, S., Roy, R., & Bhattacharya, S. (1998). An exact depth-first algorithm for the pallet loading problem. European Journal of Operational Research, 110 (3), 610-625.
6. Chan, H. H., & Markov, I. L. (2004). Practical slicing and non-slicing block-packing without simulated annealing. In GLSVLSI '04: Proceedings of the 14th ACM Great Lakes symposium on VLSI, pp. 282-287, New York, NY, USA. ACM.
7. Chazelle, B. (1983). The bottomn-left bin-packing heuristic: An efficient implementation. IEEE Transactions on Computers, C-32 (8), 697-707.
8. Clautiaux, F., Carlier, J., & Moukrim, A. (2007). A new exact method for the two-dimensional orthogonal packing problem. European Journal of Operational Research, 183(3), 1196-1211.
9. Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49(1-3), 61-95.
10. Dowsland, K. A. (1987). An exact algorithm for the pallet loading problem. European Journal of Operational Research, 31(1), 78-84.
11. Dowsland, K. A., & Dowsland, W. B. (1992). Packing problems. European Journal of Operational Research, 56(1), 2-14.
12. Huang, E., & Korf, R. E. (2009). New improvements in optimal rectangle packing. In Boutilier, C. (Ed.), IJCAI, pp. 511-516.
13. Huang, E., & Korf, R. E. (2010). Optimal rectangle packing on non-square benchmarks. In AAAI'10: Proceedings of the 24th National Conference on Artificial intelligence, pp. 317-324. AAAI Press.
14. Huang, E., & Korf, R. E. (2011). Optimal packing of high-precision rectangles. In Burgard, W., & Roth, D. (Eds.), AAAI. AAAI Press.
15. Korf, R. E. (2003). Optimal rectangle packing: Initial results. In Giunchiglia, E., Muscettola, N., & Nau, D. S. (Eds.), ICAPS, pp. 287-295. AAAI.
16. Korf, R. E. (2004). Optimal rectangle packing: New results. In Zilberstein, S., Koehler, J., & Koenig, S. (Eds.), ICAPS, pp. 142-149. AAAI.
17. Korf, R. E., Moffitt, M. D., & Pollack, M. E. (2010). Optimal rectangle packing. Annals of Operations Research, 179(1), 261-295.
18. Lahrichi, A. (1982). Scheduling: the notions of hump, compulsory parts and their use in cumulative problems. Comptes Rendus de Academie des Sciences, Paris, 294, 209-211.
19. Lesh, N., Marks, J., McMahon, A., & Mitzenmacher, M. (2004). Exhaustive approaches to 2d rectangular perfect packings. Information Processing Letters, 90(1), 7-14.
20. Li, S. C., Leong, H. W., & Quek, S. K. (2004). New approximation algorithms for some dynamic storage allocation problems. In Chwa, K.-Y., & Munro, J. I. (Eds.), COCOON, Vol. 3106 of Lecture Notes in Computer Science, pp. 339-348. Springer.
21. Lipovetskii, A. I. (2008). A geometrical approach to computation of the optimal solution of the rectangle packing problem. American Mathematical Society Translations, 222, 93-110.
22. Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research, 141(2), 241-252.
23. Lodi, A., Martello, S., & Vigo, D. (2002). Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics, 123 (1-3), 379-396.
24. Martello, S., & Vigo, D. (1998). Exact solution of the two-dimensional finite bin packing problem. Management Science, 44(3), 388-399.
25. Meir, A., & Moser, L. (1968). On packing of squares and cubes. Journal of Combinatorial Theory, 5(2), 126-134.
26. Mitola, J., & Maguire, G. (1999). Cognitive radio: making software radios more personal. IEEE Personal Communications Magazine, 6(4), 13-18.
27. Moffitt, M. D., & Pollack, M. E. (2006). Optimal rectangle packing: A meta-csp approach. In Long, D., Smith, S. F., Borrajo, D., & McCluskey, L. (Eds.), ICAPS, pp. 93-102. AAAI.
28. Onodera, H., Taniguchi, Y., & Tamaru, K. (1991). Branch-and-bound placement for building block layout. In DAC '91: Proceedings of the 28th ACM/IEEE Design Automation Conference, pp. 433-439, New York, NY, USA. ACM.
29. Simonis, H., & O'Sullivan, B. (2008). Search strategies for rectangle packing. In Stuckey, P. J. (Ed.), CP, Vol. 5202 of Lecture Notes in Computer Science, pp. 52-66. Springer.
30. Simonis, H., & O'Sullivan, B. (2011). Almost square packing. In Achterberg, T., & Beck, J. C. (Eds.), CPAIOR, Vol. 6697 of Lecture Notes in Computer Science, pp. 196-209. Springer.
31. Sweeney, P. E., & Paternoster, E. R. (1992). Cutting and packing problems: A categorized, application-orientated research bibliography. The Journal of the Operational Research Society, 43(7), 691-706.
32. Weglarz, J. (1999). Project scheduling: recent models, algorithms and applications. Springer, Kluwer.
33. Yap, R. H. C. (2004). Constraint processing by rina dechter, morgan kaufmann publishers, 2003, hard cover: Isbn 1-55860-890-7, xx + 481 pages.
34. Theory Pract. Log. Program., 4(5-6), 755-757.