A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
type: Item
instance of: scholarly article
title: A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
zbMATH Open document ID: 1088.90050
DOI: 10.1016/S0167-6377(03)00002-6
author: Young-Gun G
author: Young-Jo Seong
author: Maing-Kyu Kang
published in: Operations Research Letters
publication date: 2003-11-17T00:00:00Z
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B85
zbMATH DE Number: 2005452
zbMATH Keywords: Cutting problem
zbMATH Keywords: Optimization
zbMATH Keywords: Branch and bound
MaRDI profile type: Publication
cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: A new upper bound for unconstrained two-dimensional cutting and packing
cites work: The Theory and Computation of Knapsack Functions
cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting
cites work: An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
cites work: A recursive exact algorithm for weighted two-dimensional cutting
cites work: Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
cites work: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
full work available at URL: s0167-6377(03)00002-6
OpenAlex ID: W2066434945
description: scientific article; zbMATH DE number 2005452