✦ LIBER ✦

Reoptimizing the 0–1 knapsack problem

✍ Scribed by Claudia Archetti; Luca Bertazzi; M. Grazia Speranza

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lagrangean heuristics combined with reop

✍ Babacar Thiongane; Anass Nagih; Gérard Plateau 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The Collapsing 0–1 Knapsack Problem

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

Adjacency of the 0–1 knapsack problem

✍ Daniel Geist; Ervin Y. Rodin 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 416 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

The complexity of the 0/1 multi-knapsack

✍ Li’ang Zhang; Suyun Geng 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 205 KB