✦ LIBER ✦

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

✍ Scribed by Hiroshi Iida

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

The 0-1 Knapsack problem with a single c

✍ Hugues Marchand; Laurence A. Wolsey 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 129 KB

A note on the characterization of the ma

✍ William Voxman; Roy Goetschel 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 277 KB

A fully polynomial approximation algorit

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