A note on the Martello-Toth algorithm for one-dimensional knapsack problems

DOI10.1016/0377-2217(85)90290-5MaRDI QIDQ2265950zbMATH OpenOpenAlexFDO

Authors Leena Aittoniemi, Klaus Oehlandt

Publication date 1985

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(85)90290-5

zbMATH Keywords

correctiongeneral one-dimensional knapsack

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Review text

We correct a mistake in the Martello-Toth algorithm [see \textit{S. Martello} and \textit{P. Toth}, Adv. Oper. Res., Proc. 2nd Eur. Congr., Stockholm 1976, 295-301 (1977; Zbl 0372.90094)] for the general one- dimensional knapsack problem.

Recommendations

• A computational note on the Martello-Toth knapsack algorithm
• Comment on 'Some computational results on real 0-1 knapsack problems'
• An algorithm for solving a class of knapsack problems and its generalization
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• A New Algorithm for the 0-1 Knapsack Problem

Cited in

(3)

• Knowledge based approach to the cutting stock problem
• A computational note on the Martello-Toth knapsack algorithm
• Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems

This page was built for publication: A note on the Martello-Toth algorithm for one-dimensional knapsack problems

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