Bounds for nested knapsack problems

DOI10.1016/0377-2217(93)E0211-FzbMath0913.90219MaRDI QIDQ1130040

Robert E. Johnston, Lutfar R. Khan

Publication date: 16 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

cutting stocknested knapsack problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (6)

The one dimensional Compartmentalised Knapsack problem: a case study ⋮ The constrained compartmentalised knapsack problem ⋮ Optimal selection of touristic packages based on user preferences during sports mega-events ⋮ An integer linear optimization model to the compartmentalized knapsack problem ⋮ On the approximability of the two-phase knapsack problem ⋮ Algorithms for the one-dimensional two-stage cutting stock problem

Cites Work

• Exact methods for the knapsack problem and its generalizations
• Solution of the zero-one multiple knapsack problem
• A typology of cutting and packing problems
• Technical Note—The Multiperiod Knapsack Problem
• The Multiple-Choice Nested Knapsack Model
• The Multiple-Choice Knapsack Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds for nested knapsack problems