A branch-and-bound algorithm for the two-dimensional vector packing problem
type: Item
instance of: scholarly article
title: A branch-and-bound algorithm for the two-dimensional vector packing problem
zbMATH Open document ID: 0789.90063
DOI: 10.1016/0305-0548(94)90059-0
author: Frits C. R. Spieksma
published in: Computers \& Operations Research
publication date: 1994-03-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 527457
zbMATH Keywords: two-dimensional vector packing
zbMATH Keywords: heuristic
zbMATH Keywords: first fit decreasing rule
zbMATH Keywords: branch-and-bound
MaRDI profile type: Publication
full work available at URL: 0305-0548(94)90059-0
OpenAlex ID: W2058596271
cites work: Q3993418
cites work: Q3347319
cites work: Q4198056
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: Resource constrained scheduling as generalized bin packing
cites work: Bithreshold Graphs
cites work: Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
description: scientific article; zbMATH DE number 527457