✦ LIBER ✦

Scatter Search for the 0–1 Multidimensional Knapsack Problem

✍ Scribed by Said Hanafi; Christophe Wilbaut

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved convergent heuristics for the 0

✍ Saïd Hanafi; Christophe Wilbaut 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 406 KB

The Multidimensional 0-1 Knapsack Proble

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

The Collapsing 0–1 Knapsack Problem

✍ Marc E. Posner; Monique Guignard 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 303 KB

Testable heuristics for the 0–1 knapsack

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

An algorithm for the 0/1 Knapsack proble

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

A best first search exact algorithm for

✍ Abdelkader Sbihi 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 348 KB