Solving sequential knapsack problems
type: Item
instance of: scholarly article
title: Solving sequential knapsack problems
zbMATH Open document ID: 0793.90039
DOI: 10.1016/0167-6377(93)90044-H
author: Todd Olmstead
author: Mark Hartmann
published in: Operations Research Letters
publication date: 1993-11-28T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 440372
zbMATH Keywords: relaxation bounds
zbMATH Keywords: recursive algorithm
zbMATH Keywords: sequential knapsack problems
MaRDI profile type: Publication
cites work: A fast algorithm for optimal length-limited Huffman codes
cites work: The cutting stock problem and integer rounding
cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
full work available at URL: 0167-6377(93)90044-h
OpenAlex ID: W1991782955
description: scientific article; zbMATH DE number 440372