✦ LIBER ✦

The 0-1 Knapsack problem with a single continuous variable

✍ Scribed by Hugues Marchand; Laurence A. Wolsey

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An exact algorithm for the 0–1 linear kn

✍ Geng Lin; Wenxing Zhu; M. M. Ali 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 246 KB

Tackling 0/1 knapsack problem with gene

✍ A. K. Bhatia; S. K. Basu 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 413 KB

The 0–1 knapsack problem with multiple c

✍ Robert M. Nauss 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 787 KB

A hypercube algorithm for the 0/1 Knapsa

✍ Jong Lee; Eugene Shragowitz; Sartaj Sahni 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 878 KB

A parallel algorithm for the 0–1 knapsac

✍ W. Loots; T. H. C. Smith 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 626 KB

Algorithm 37 Algorithm for the solution

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