0-1 knapsack problems with a side constraint

MaRDI QIDQ5323364zbMATH OpenFDO

Authors

Publication date 23 July 2009

Full work available at URL https://eudml.org/doc/40140, http://www.idescat.cat/sort/questiio/questiiopdf/12.2.4.barcelo.pdf

zbMATH Keywords

implicit enumerationknapsackLagrangian relaxation

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem
• The zero-one knapsack problem with equality constraint
• \(0\)-\(1\) knapsack problems
• scientific article; zbMATH DE number 1302173
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality

Cited in

(3)

• Efficient reformulation for 0-1 programs -- methods and computational results
• The zero-one knapsack problem with equality constraint
• scientific article; zbMATH DE number 847586 (Why is no real title available?)

This page was built for publication: \(0\)-\(1\) knapsack problems with a side constraint

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