✦ LIBER ✦

Improved convergent heuristics for the 0-1 multidimensional knapsack problem

✍ Scribed by Saïd Hanafi; Christophe Wilbaut

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Testable heuristics for the 0–1 knapsack

✍ Bruno Apolloni 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 866 KB

Scatter Search for the 0–1 Multidimensio

✍ Said Hanafi; Christophe Wilbaut 📂 Article 📅 2008 🏛 Springer Netherlands 🌐 English ⚖ 328 KB

A heuristic algorithm for the multidimen

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

An improved parallel algorithm for 0/1 k

✍ Gen-Huey Chen; Jin-Hwang Jang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 870 KB

The Multidimensional 0-1 Knapsack Proble

✍ Arnaud Fréville; SaÏd Hanafi 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 281 KB

An algorithm for the 0/1 Knapsack proble

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