✦ LIBER ✦

A computational note on the Martello-Toth knapsack algorithm

✍ Scribed by Francis J. Vasko

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved upper bound for the zero-one

✍ Heiner Müller-Merbach 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 166 KB

Knapsack problems, algorithms and comput

✍ Jeroen De Kort 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 161 KB

An upper bound for the zero-one knapsack

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 831 KB

Computational results with a branch-and-

✍ R. L. Bulfin; R. G. Parker; C. M. Shetty 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB 👁 1 views

A computational note on von Neumann's al

✍ Martin Hershkowitz 📂 Article 📅 1964 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB

A heuristic algorithm for the multidimen

✍ M.J. Magazine; Osman Oguz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 488 KB