✦ LIBER ✦

A note on 0.5-bounded greedy algorithms for the 0⧸1 knapsack problem

✍ Scribed by Silvano Martello; Paolo Toth

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple 0.5-bounded greedy algorithm fo

✍ U.K. Sarkar; P.P. Chakrabarti; S. Ghose; S.C. De Sarkar 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 442 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

A Note on the Max-Min 0-1 Knapsack Probl

✍ Hiroshi Iida 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 39 KB

A branch-and-bound algorithm for multi-d

✍ Juan Sun; Hong-bo Sheng; Xiao-ling Sun 📂 Article 📅 2007 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 163 KB

Upper bounds for the 0-1 stochastic knap

✍ Stefanie Kosuch; Abdel Lisser 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 526 KB