A new graph-theoretical model for k-dimensional guillotine-cutting problems

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

Volumn 5038 LNCS, Issue , 2008, Pages 43-54

  Clautiaux, François ^a   Jouglet, Antoine ^b   Moukrim, Aziz ^b  

^a UNIV LILLE   (France)

^b CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

(2+1)-DIMENSIONAL; CONSTRAINT PROGRAMMING (CP); CUTTING PROBLEMS; EXPERIMENTAL ALGORITHMS; GUILLOTINE CUTS; HEIDELBERG (CO); INTERNATIONAL (CO); LINEAR ALGORITHMS; NEW CLASS; ORIENTED GRAPHS; SPRINGER (CO);

ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTER PROGRAMMING; CONSTRAINT THEORY; EVOLUTIONARY ALGORITHMS; GRAPH THEORY; INTEGER PROGRAMMING; SET THEORY;

MATHEMATICAL MODELS;

EID: 45449096285     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68552-4_4     Document Type: Conference Paper

References (12)

1. 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)
2. Messaoud, S.B.: Caract́erisation, modélisation et algorithmes pour des probl̀emes de d́ecoupe guillotine. PhD thesis, Université de Technologie de Troyes (2004)
3. Christofides, N., Hadjiconstantinou, E.: An exact algorithm for orthogonal 2-d cutting problems using guillotine cuts. European Journal of Operational Research 83, 21-38 (1995)
4. Clautiaux, F., Jouglet, A., Carlier, J., Moukrim, A.: A new constraint programming approach for the orthogonal packing problem. Computers and Operations Research 35(3), 944-959 (2008)
5. Clautiaux, F., Jouglet, A., Moukrim, A.: A new graph-theoretical model for k-dimensional guillotine-cutting problems. Technical report, Université des Sciences et Technologies de Lille (2008), http://www.iut-info.univ-lille1.fr/∼clautiau/graph.pdf
6. Fekete, S., Schepers, J.: A combinatorial characterization of higher-dimensional orthogonal packing. Mathematics of Operations Research 29, 353-368 (2004)
7. Fekete, S., Schepers, J., Van Der Ween, J.: An exact algorithm for higher-dimensional orthogonal packing. Operations Research 55(3), 569-587 (2007)
8. Hifi, M.: Exact algorithms for the guillotine strip cutting/packing problem. Computers and Operations Research 25(11), 925-940 (1998)
9. Ilog: Ilog Solver Reference Manual, Gentilly, France (2004)
10. Viswanathan, K.V., Bagchi, A.: Best-first search methods for constrained two-dimensional cutting stock problem. Operations Research 41, 768-776 (1993)
11. Wang, P.Y.: Two algorithms for constrained two-dimensional cutting stock problems. Operations Research 31, 573-586 (1983)
12. Wáscher, G., Haussner, H., Schumann, H.: An improved typology of cutting and packing problems. European Journal of Operational Research 183, 1109-1130 (2007)