Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions

RAIRO Recherche Operationnelle

Volumn 30, Issue 2, 1996, Pages 111-125

  Hifi, Mhand ^a   Zissimopoulos, Vassilis ^b  

^a UNIVERSITÉ PARIS 1 PANTHÉON SORBONNE   (France)

^b Laboratoire Interdisciplinaire des Sciences du Numérique   (France)

Author keywords

Cutting stock problems; Dynamic programming; Knapsack; Recursive algorithms

Indexed keywords

DYNAMIC PROGRAMMING;

COMBINATORIAL OPTIMIZATION; CUTTING STOCK PROBLEM; KNAPSACK PROBLEM; RECURSIVE ALGORITHM;

CUTTING;

EID: 0030356268     PISSN: 03990559     EISSN: None     Source Type: Journal    
DOI: 10.1051/ro/1996300201111     Document Type: Article

References (6)

1. D. FAYARD et G. PLATEAU, An Algorithm for the Solution of the 0-1 Knapsack Problem, Computing, 1982, 28, p. 269-287.
2. P. GILMORE et R. GOMORY, The Theory and Computation of Knapsack Functions, Opns. Res., 1966, 14, p. 1045-1074.
3. J. HERZ, A Recursive Computing Procedure for Two-Dimensional Stock Cutting, IBM J. Res. Develop., 1972, 16, p. 462-469.
4. P. TOTH, Dynamic Programming Algorithms for the Zero-One Knapsack Problem, Computing, 1980, 25, p. 29-45.
5. V. ZISSIMOPOULOS, Problèmes de Découpe : Algorithmes ε-Approchants, Thesis, L.R.I., Orsay, 1984.
6. V. ZISSIMOPOULOS, Heuristic Methods For Solving (Un)Constrained Two Dimensional Cutting Stock Problems, Methods of Operations Research, 1984, 49, p. 345-357.