A fast algorithm for the linear multiple-choice knapsack problem

Authors:
Krzysztof Dudziski;Stanisaw Walukiewicz
Affiliations:
Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland;Systems Research Institute, Polish Academy of Sciences, Warsaw, Poland
Venue:
Operations Research Letters
Year:
1984

Citing 2
Cited 1

The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
A note of the knapsack problem with special ordered sets

Operations Research Letters

The linear multiple choice knapsack problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

A description of an algorithm for solving the linear multiple-choice knapsack problem is given. The algorithm has a convenient structure for a branch-and bound approach to the multiple-choice knapsack problem.