A computational study of a multiple-choice knapsack algorithm

DOI10.1145/357456.357458MaRDI QIDQ3657427zbMATH OpenOpenAlexFDO

Authors David S. Kung, Prabhakant Sinha, Andris A. Zoltners, Ronald D. Armstrong

Publication date 1983

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/357456.357458

zbMATH Keywords

comparative studymultiple-choice knapsack algorithmtests

Mathematics Subject Classification ID

Algorithms in computer science (68W99) Integer programming (90C10)

Cited in

(10)

• Exact methods for the knapsack problem and its generalizations
• A minimal algorithm for the multiple-choice knapsack problem
• The bottleneck generalized assignment problem
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
• Multi-constrained matroidal knapsack problems
• A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
• An improved binary search algorithm for the multiple-choice knapsack problem
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting
• A branch and bound algorithm for solving the multiple-choice knapsack problem
• The matroidal knapsack: A class of (often) well-solvable problems

This page was built for publication: A computational study of a multiple-choice knapsack algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3657427)