✦ LIBER ✦

The Multidimensional 0-1 Knapsack Problem—Bounds and Computational Aspects

✍ Scribed by Arnaud Fréville; SaÏd Hanafi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Scatter Search for the 0–1 Multidimensio

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

Improved convergent heuristics for the 0

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

A recursive branch and bound algorithm f

✍ Arne Thesen 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 655 KB

Upper bounds for the 0-1 stochastic knap

✍ Stefanie Kosuch; Abdel Lisser 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 526 KB

Computational results with a branch-and-

✍ R. L. Bulfin; R. G. Parker; C. M. Shetty 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB 👁 1 views

Approximation algorithms for the m-dimen

✍ A.M. Frieze; M.R.B. Clarke 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 419 KB