A computational study of a multiple-choice knapsack algorithm
From MaRDI portal
Publication:3657427
DOI10.1145/357456.357458zbMath0512.68029OpenAlexW1993814189MaRDI QIDQ3657427
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
Related Items (10)
Exact methods for the knapsack problem and its generalizations ⋮ A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem ⋮ A minimal algorithm for the multiple-choice knapsack problem ⋮ The bottleneck generalized assignment 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 \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints ⋮ A branch and bound algorithm for solving the multiple-choice knapsack problem ⋮ Multi-constrained matroidal knapsack problems ⋮ 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
