✦ LIBER ✦

A note on the Martello-Toth algorithm for one-dimensional knapsack problems

✍ Scribed by Leena Aittoniemi; Klaus Oehlandt

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A computational note on the Martello-Tot

✍ Francis J. Vasko 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 139 KB

An improved upper bound for the zero-one

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

A General Algorithm for One-Dimensional

✍ Giorgio P. Ingargiola and James F. Korsh 📂 Article 📅 1977 🏛 INFORMS 🌐 English ⚖ 280 KB

A Bound and Bound algorithm for the zero

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

An upper bound for the zero-one knapsack

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

A note on 0.5-bounded greedy algorithms

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