✦ LIBER ✦

Approximate Algorithms for the 0/1 Knapsack Problem

✍ Scribed by Sahni, Sartaj

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Fully Polynomial Approximation Algor

✍ Liu 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 65 KB

A fully polynomial approximation algorit

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

Approximation algorithms for the m-dimen

✍ A.M. Frieze; M.R.B. Clarke 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 419 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

Dynamic programming based algorithms for

✍ Aiying Rong; José Rui Figueira; Kathrin Klamroth 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 367 KB