✦ LIBER ✦

The Fully Polynomial Approximation Algorithm for the 0-1 Knapsack Problem

✍ Scribed by Liu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fully polynomial approximation algorit

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

An algorithm for the 0/1 Knapsack proble

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

A hypercube algorithm for the 0/1 Knapsa

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

A parallel algorithm for the 0–1 knapsac

✍ W. Loots; T. H. C. Smith 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 626 KB

An exact algorithm for the 0–1 collapsin

✍ Didier Fayard; Gérard Plateau 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 733 KB

An algorithm for the solution of the 0–1

✍ D. Fayard; G. Plateau 📂 Article 📅 1982 🏛 Springer Vienna 🌐 English ⚖ 812 KB