✦ LIBER ✦

The complexity of the 0/1 multi-knapsack problem

✍ Scribed by Li’ang Zhang; Suyun Geng

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving efficiently the 0–1 multi-object

✍ Cristina Bazgan; Hadrien Hugot; Daniel Vanderpooten 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 380 KB

The Collapsing 0–1 Knapsack Problem

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

Reoptimizing the 0–1 knapsack problem

✍ Claudia Archetti; Luca Bertazzi; M. Grazia Speranza 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 252 KB

Adjacency of the 0–1 knapsack problem

✍ Daniel Geist; Ervin Y. Rodin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 416 KB

Implementing an efficient fptas for the

✍ Cristina Bazgan; Hadrien Hugot; Daniel Vanderpooten 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Testable heuristics for the 0–1 knapsack

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