A recursive exact algorithm for weighted two-dimensional cutting
type: Item
instance of: scholarly article
title: A recursive exact algorithm for weighted two-dimensional cutting
zbMATH Open document ID: 0924.90118
DOI: 10.1016/0377-2217(95)00343-6
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
zbMATH DE Number: 1252861
zbMATH Keywords: knapsack
zbMATH Keywords: two-dimensional cutting
zbMATH Keywords: dynamic programming
zbMATH Keywords: exact algorithms
zbMATH Keywords: heurstics
zbMATH Keywords: recursivity
author: Mhand Hifi
author: V. Zissimopoulos
MaRDI profile type: Publication
full work available at URL: 0377-2217(95)00343-6
OpenAlex ID: W2010428988
cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: Packing problems
cites work: An approximation algorithm for solving unconstrained two-dimensional knapsack problems
cites work: Multistage Cutting Stock Problems of Two and More Dimensions
cites work: The Theory and Computation of Knapsack Functions
cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting
cites work: Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions
cites work: An and-or-graph approach for two-dimensional cutting problems
cites work: An improved version of Wang's algorithm for two-dimensional cutting problems
cites work: Q3693257
cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
cites work: Q3724077
description: scientific article; zbMATH DE number 1252861