The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
type: Item
instance of: scholarly article
title: The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
zbMATH Open document ID: 0929.90073
DOI: 10.1016/S0377-2217(96)00060-4
published in: European Journal of Operational Research
publication date: 1999-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1253144
zbMATH Keywords: weighted and unweighted unconstrained two-dimensional guillotine cutting
zbMATH Keywords: depth-first search
zbMATH Keywords: hill-climbing
zbMATH Keywords: one-dimensional knapsack
zbMATH Keywords: dynamic programming
author: Mhand Hifi
MaRDI profile type: Publication
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
cites work: Pipeline architectures for dynamic programming algorithms
cites work: An Algorithm for Two-Dimensional Cutting 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: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
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: Nonorthogonal Two-Dimensional Cutting Patterns
cites work: Q3693257
cites work: Dynamic programming algorithms for the zero-one knapsack problem
cites work: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
cites work: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
cites work: Q3724077
full work available at URL: s0377-2217(96)00060-4
OpenAlex ID: W2160776415
Wikidata QID: Q127613595
description: scientific article; zbMATH DE number 1253144