Bounds for nested knapsack problems
type: Item
instance of: scholarly article
title: Bounds for nested knapsack problems
zbMATH Open document ID: 0913.90219
DOI: 10.1016/0377-2217(93)E0211-F
author: Robert E. Johnston
author: Lutfar R. Khan
published in: European Journal of Operational Research
publication date: 1998-08-16T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1191357
zbMATH Keywords: nested knapsack problem
zbMATH Keywords: cutting stock
MaRDI profile type: Publication
cites work: Q4054519
cites work: The Multiple-Choice Nested Knapsack Model
cites work: Q3347319
cites work: Exact methods for the knapsack problem and its generalizations
cites work: A typology of cutting and packing problems
cites work: Technical Note—The Multiperiod Knapsack Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Q3142058
cites work: Solution of the zero-one multiple knapsack problem
cites work: Q3993418
cites work: Q3992496
cites work: The Multiple-Choice Knapsack Problem
description: scientific article; zbMATH DE number 1191357