✦ LIBER ✦

Heuristic algorithms for the general nonlinear separable knapsack problem

✍ Scribed by Claudia D’Ambrosio; Silvano Martello

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Heuristic algorithms for the multiple kn

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

Heuristic and Exact Algorithms for the P

✍ N. Samphaiboon; Y. Yamada 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 150 KB

A heuristic algorithm for the multidimen

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

Greedy algorithm for the general multidi

✍ Yalçın Akçay; Haijun Li; Susan H. Xu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 328 KB

Approximate algorithms for some generali

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

A complementary greedy heuristic for the

✍ D.J. White 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 411 KB