Computational aspects of hard knapsack problems.

DOI10.1016/S0362-546X(01)00658-7zbMath1042.90605OpenAlexW1973002902WikidataQ56050291 ScholiaQ56050291MaRDI QIDQ1875611

A. Kulanoot, Louis Caccetta

Publication date: 26 August 2004

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0362-546x(01)00658-7

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items (4)

Tight bounds for periodicity theorems on the unbounded knapsack problem ⋮ A heuristic for the problem of one-dimensional steel coil cutting ⋮ A hybrid algorithm for the unbounded knapsack problem ⋮ Statistical mechanics analysis of generalized multi-dimensional knapsack problems

This page was built for publication: Computational aspects of hard knapsack problems.