scientific article; zbMATH DE number 3580280

MaRDI QIDQ4149228zbMATH OpenFDO

Authors Silvano Martello, Paolo Toth

Publication date 1977

Mathematics Subject Classification ID

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

Cited in

(8)

• A note on dominance relation in unbounded knapsack problems
• Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem
• An empirical analysis of exact algorithms for the unbounded knapsack problem
• A note on the Martello-Toth algorithm for one-dimensional knapsack problems
• Algorithms for the bounded set-up knapsack problem
• Determining the K-best solutions of knapsack problems
• A minimal algorithm for the bounded knapsack problem
• An exact algorithm for large unbounded knapsack problems

This page was built for publication:

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