Search strategies for rectangle packing

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

Volumn 5202 LNCS, Issue , 2008, Pages 52-66

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

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

AD HOC NETWORKS; ARTS COMPUTING; COMPUTER AIDED DESIGN; COMPUTER PROGRAMMING; CONSTRAINT THEORY; PROLOG (PROGRAMMING LANGUAGE);

CIRCUIT LAYOUTS; COMPUTING PLATFORMS; CONSTRAINT PROGRAMMING SYSTEMS; CONSTRAINT PROGRAMMINGS; CP MODELS; CURRENT STATES; DO-MAINS; ELECTRONIC DESIGN AUTOMATIONS; OPEN PROBLEMS; PACKING PROBLEMS; RECTANGLE PACKING PROBLEMS; RECTANGLE PACKINGS; SEARCH STRATEGIES; SICSTUS PROLOGS; THREE ORDERS OF MAGNITUDES;

PROBLEM SOLVING;

EID: 56449086533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85958-1_4     Document Type: Conference Paper

References (16)

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. In: Prob009 in CSPLIB(1999)
3. Beldiceanu, N., Carlsson, M.: Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Walsh [16], pp. 377-391
4. Beldiceanu, N., Carlsson, M., Poder, E.: New filtering for the cumulative constraint in the context of non-overlapping. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 21-35. Springer, Heidelberg (2008)
5. Beldiceanu, N., Carlsson, M., Poder, E., Sadek, R., Truchet, C.: A generic geometrical constraint kernel in space and time for handling polymorphic -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 [16], pp. 392-407.
8. Carlsson, M., et al.: SICStus Prolog User's Manual, 4th edn. Swedish Institute of Computer Science (2007) ISBN 91-630-3648-7
9. Gent, I., Petrie, K., Puget, J.F.: Symmetry in constraint programming. In: Rossi, F., van Beek, P., Walsh, T. (eds.) Handbook of Constraint Programming, ch. 10. Elsevier, Amsterdam (2006)
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)
12. 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)
13. 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)
14. Roy, J.A., Markov, I.L.: Eco-system: Embracing the change in placement. In: ASP-DAC, pp. 147-152. IEEE, Los Alamitos (2007)
15. 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)
16. Walsh, T. (ed.): Principles and Practice of Constraint Programming - CP 2001. LNCS, vol. 2239. Springer, Heidelberg (2001)