✦ LIBER ✦

A successive approximation algorithm for the multiple knapsack problem

✍ Scribed by Zhenbo Wang; Wenxun Xing

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A minimal algorithm for the multiple-cho

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

Heuristic algorithms for the multiple kn

✍ S. Martello; P. Toth 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 835 KB

A fast algorithm for the linear multiple

✍ Krzysztof Dudziński; Stanisław Walukiewicz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 256 KB

Approximate algorithms for some generali

✍ Ashok K. Chandra; D.S. Hirschberg; C.K. Wong 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 361 KB

Approximation for knapsack problems with

✍ Li’ang Zhang; Yin Zhang 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 477 KB

A fully polynomial approximation algorit

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