✦ LIBER ✦

An expanding-core algorithm for the exact 0–1 knapsack problem

✍ Scribed by David Pisinger

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An exact algorithm for large unbounded k

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

A hypercube algorithm for the 0/1 Knapsa

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

A fully polynomial approximation algorit

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

An exact search for the solution of the

✍ Arnaud Fréville; Gérard Plateau 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 598 KB