A fast algorithm for the linear multiple-choice knapsack problem

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.

Saved in:
Bibliographic Details
Published in:Operations research letters 1984-01, Vol.3 (4), p.205-209
Main Authors: Dudziński, Krzysztof, Walukiewicz, Stanisław
Format: Article
Language:English
Subjects:
median finding in ordered sets
multiple-choice knapsack problem
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0167-6377
1872-7468
DOI:10.1016/0167-6377(84)90027-0