Computational aspects of hard knapsack problems.
From MaRDI portal
Publication:1875611
DOI10.1016/S0362-546X(01)00658-7zbMath1042.90605WikidataQ56050291 ScholiaQ56050291MaRDI QIDQ1875611
Publication date: 26 August 2004
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
90C27: Combinatorial optimization
90C09: Boolean programming
Related Items
Tight bounds for periodicity theorems on the unbounded knapsack problem, A hybrid algorithm for the unbounded knapsack problem