✦ LIBER ✦

Dynamic programming based algorithms for the discounted {0–1} knapsack problem

✍ Scribed by Aiying Rong; José Rui Figueira; Kathrin Klamroth

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic programming algorithms for the Z

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

Linear programming for the 0–1 quadratic

✍ Alain Billionnet; Frédéric Calmels 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 852 KB

A dynamic programming algorithm for the

✍ Luce Brotcorne; Saïd Hanafi; Raïd Mansi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 940 KB

An algorithm for the 0/1 Knapsack proble

✍ Marion Lauriere 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 375 KB

An algorithm for 0-1 multiple-knapsack p

✍ Ming S. Hung; John C. Fisk 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 528 KB

A hypercube algorithm for the 0/1 Knapsa

✍ Jong Lee; Eugene Shragowitz; Sartaj Sahni 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 878 KB