✦ LIBER ✦

The zero-one knapsack problem with equality constraint

✍ Scribed by L. Kaufman; F. Plastria; S. Tubeeckx

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solution of the zero-one multiple knapsa

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 691 KB

The knapsack problem with neighbour cons

✍ Borradaile, Glencora; Heeringa, Brent; Wilfong, Gordon 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 273 KB

Knapsack problem with probability constr

✍ Alexei A. Gaivoronski; Abdel Lisser; Rafael Lopez; Hu Xu 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 190 KB

Dynamic programming algorithms for the Z

✍ P. Toth 📂 Article 📅 1980 🏛 Springer Vienna 🌐 English ⚖ 786 KB

The knapsack problem with a minimum fill

✍ Xu, Zhou 📂 Article 📅 2013 🏛 John Wiley and Sons 🌐 English ⚖ 176 KB

A heuristic algorithm for the multidimen

✍ M.J. Magazine; Osman Oguz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 488 KB