✦ LIBER ✦

An exact algorithm for the 0–1 linear knapsack problem with a single continuous variable

✍ Scribed by Geng Lin; Wenxing Zhu; M. M. Ali

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The 0-1 Knapsack problem with a single c

✍ Hugues Marchand; Laurence A. Wolsey 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 129 KB

An exact algorithm for the 0–1 collapsin

✍ Didier Fayard; Gérard Plateau 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 733 KB

An expanding-core algorithm for the exac

✍ David Pisinger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 747 KB

Exact solution of the equation for the p

✍ Rabindra Nath Das 📂 Article 📅 1978 🏛 Springer Netherlands 🌐 English ⚖ 309 KB