✦ LIBER ✦

A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem

✍ Scribed by U.K. Sarkar; P.P. Chakrabarti; S. Ghose; S.C. De Sarkar

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on 0.5-bounded greedy algorithms

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 130 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

An algorithm for the 0/1 Knapsack proble

✍ Marion Lauriere 📂 Article 📅 1978 🏛 Springer-Verlag 🌐 English ⚖ 375 KB

An algorithm for 0-1 multiple-knapsack p

✍ Ming S. Hung; John C. Fisk 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 528 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