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

DOI10.1051/RO/1996300201111zbMATH Open0859.90107OpenAlexW2518911661MaRDI QIDQ5689727FDOQ5689727

V. Zissimopoulos, Mhand Hifi

Publication date: 10 April 1997

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/105123

Recommendations

• A recursive exact algorithm for weighted two-dimensional cutting
• A recursive algorithm for constrained two-dimensional cutting problems
• An improved version of Wang's algorithm for two-dimensional cutting problems
• An algorithm for the 2D guillotine cutting stock problem
• A Two-phase Heuristic for the Two-dimensional Cutting-stock Problem

zbMATH Keywords

recursive algorithmknapsacktwo-dimensional cutting stock

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39)

Cited In (4)

• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
• A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
• A fast algorithm for detecting admissible cuts in prestressed hollow core units
• A recursive exact algorithm for weighted two-dimensional cutting

This page was built for publication: Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5689727)