Computational aspects of hard knapsack problems.

DOI10.1016/S0362-546X(01)00658-7MaRDI QIDQ1875611zbMATH OpenOpenAlexWikidataFDO

Authors Araya 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) Boolean programming (90C09) Combinatorial optimization (90C27)

Cited in

(5)

• A hybrid algorithm for the unbounded knapsack problem
• A heuristic for the problem of one-dimensional steel coil cutting
• Tight bounds for periodicity theorems on the unbounded knapsack problem
• Statistical mechanics analysis of generalized multi-dimensional knapsack problems
• A fully parallelized and budgeted multilevel Monte Carlo method and the application to acoustic waves

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

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