Almost square packing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6697 LNCS, Issue , 2011, Pages 196-209

  Simonis, Helmut ^a   O'Sullivan, Barry ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

DECOMPOSITION METHODS; DEGREE OF FREEDOM; EXECUTION TIME; MINIMAL AREA; PACKING PROBLEMS; PROBLEM SIZE; RECTANGLE PACKING PROBLEM; REDUNDANT CONSTRAINTS; SEARCH STRATEGIES; SEARCH TREES; THREE ORDERS OF MAGNITUDE; CUMULATIVE CONSTRAINTS; FINDING SOLUTIONS;

COMPUTER PROGRAMMING; CONSTRAINT THEORY; GEOMETRY; OPTIMIZATION; VISUALIZATION; COMBINATORIAL OPTIMIZATION; DEGREES OF FREEDOM (MECHANICS);

COMBINATORIAL OPTIMIZATION; PROBLEM SOLVING;

EID: 79956302597     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-21311-3_19     Document Type: Conference Paper

References (20)

1. Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling problems. Journal of Mathematical and Computer Modelling 17(7), 57-73 (1993)
2. Beldiceanu, N., Bourreau, E., Simonis, H.: A note on perfect square placement, Prob009 in CSPLIB (1999)
3. Beldiceanu, N., Carlsson, M.: Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Walsh [20], pp. 377-391.
4. Beldiceanu, N., Carlsson, M., Poder, E.: New filtering for the cumulative constraint in the context of non-overlapping. In: CP-AI-OR 2008, Paris (May 2008)
5. Beldiceanu, N., Carlsson, M., Poder, E., Sadek, R., Truchet, C.: A generic geometrical constraint kernel in space and time for handling polymorphic k-dimensional objects. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 180-194. Springer, Heidelberg (2007)
6. Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Journal of Mathematical and Computer Modelling 20(12), 97-123 (1994)
7. Beldiceanu, N., Guo, Q., Thiel, S.: Non-overlapping constraints between convex polytopes. In: Walsh [20], pp. 392-407
8. Huang, E., Korf, R. E.: New improvements in optimal rectangle packing. In: Boutilier, C. (ed.) IJCAI, pp. 511-516 (2009)
9. Huang, E., Korf, R. E.: Optimal rectangle packing on non-square benchmarks. In: Fox, M., Poole, D. (eds.) AAAI. AAAI Press, Menlo Park (2010)
10. Korf, R. E.: Optimal rectangle packing: Initial results. In: Giunchiglia, E., Muscettola, N., Nau, D. S. (eds.) ICAPS, pp. 287-295. AAAI, Menlo Park (2003)
11. Korf, R. E.: Optimal rectangle packing: New results. In: Zilberstein, S., Koehler, J., Koenig, S. (eds.) ICAPS, pp. 142-149. AAAI, Menlo Park (2004) (Pubitemid 40201840)
12. Korf, R., Moffitt, M., Pollack, M.: Optimal rectangle packing. Annals of Operations Research 179, 261-295 (2010), 10.1007/s10479-008-0463-6
13. MacHale, D.: The almost square problem. Personal Communication (2008)
14. Moffitt, M. D., Ng, A. N., Markov, I. L., Pollack, M. E.: Constraint-driven floorplan repair. In: Sentovich, E. (ed.) DAC, pp. 1103-1108. ACM, New York (2006) (Pubitemid 47114062)
15. Moffitt, M. D., Pollack, M. E.: Optimal rectangle packing: A meta-CSP approach. In: Long, D., Smith, S. F., Borrajo, D., McCluskey, L. (eds.) ICAPS, pp. 93-102. AAAI, Menlo Park (2006) (Pubitemid 44074201)
16. Roy, J. A., Markov, I. L.: Eco-system: Embracing the change in placement. In: ASP-DAC, pp. 147-152. IEEE, los Alamitos (2007)
17. Simonis, H., Davern, P., Feldman, J., Mehta, D., Quesada, L., Carlsson, M.: A generic visualization platform for CP. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 460-474. Springer, Heidelberg (2010)
18. Simonis, H., O'Sullivan, B.: Search Strategies for Rectangle Packing. In: Stuckey, P. J. (ed.) CP 2008. LNCS, vol. 5202, pp. 52-66. Springer, Heidelberg (2008)
19. Van Hentenryck, P.: Scheduling and packing in the constraint language cc (FD). In: Zweben, M., Fox, M. (eds.) Intelligent Scheduling. Morgan Kaufmann Publishers, San Francisco (1994)
20. Walsh, T. (ed.): CP 2001. LNCS, vol. 2239. Springer, Heidelberg (2001)