✦ LIBER ✦

A fully polynomial approximation algorithm for the 0–1 knapsack problem

✍ Scribed by M.J. Magazine; Osman Oguz

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A hypercube algorithm for the 0/1 Knapsa

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

An improved parallel algorithm for 0/1 k

✍ Gen-Huey Chen; Jin-Hwang Jang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 870 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 fully polynomial approximation scheme

✍ E.L. Lawler 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 169 KB

An expanding-core algorithm for the exac

✍ David Pisinger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 747 KB

Approximation algorithms for the m-dimen

✍ A.M. Frieze; M.R.B. Clarke 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 419 KB