✦ LIBER ✦

Testable heuristics for the 0–1 knapsack problem

✍ Scribed by Bruno Apolloni

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 Collapsing 0–1 Knapsack Problem

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

Heuristic algorithms for the multiple kn

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

An algorithm for the 0/1 Knapsack proble

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

A complementary greedy heuristic for the

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

Linear programming for the 0–1 quadratic

✍ Alain Billionnet; Frédéric Calmels 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 852 KB