✦ LIBER ✦

Algorithms for the bounded set-up knapsack problem

✍ Scribed by Laura A. McLay; Sheldon H. Jacobson

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Bound and Bound algorithm for the zero

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

Linear Time Algorithms for Knapsack Prob

✍ David Pisinger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 140 KB

A note on 0.5-bounded greedy algorithms

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

Heuristic algorithms for the multiple kn

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

A recursive branch and bound algorithm f

✍ Arne Thesen 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 655 KB

Bounds for nested knapsack problems

✍ Robert E. Johnston; Lutfar R. Khan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 688 KB