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

DOI10.1016/0377-2217(85)90290-5zbMATH Open0559.90064OpenAlexW1985657670MaRDI QIDQ2265950FDOQ2265950

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

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

zbMATH Keywords

correctiongeneral one-dimensional knapsack

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)

Cited In (3)

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

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)