✦ LIBER ✦

A note on upper bounds to the robust knapsack problem with discrete scenarios

✍ Scribed by Goerigk, Marc

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A note on upper bounds for the selection

✍ Tatsuya Motoki 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 566 KB

On the determination of the upper bound

✍ B. G. Litvak; A. V. Naivel't 📂 Article 📅 1973 🏛 Springer US 🌐 English ⚖ 121 KB

An upper bound for the zero-one knapsack

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

Bounds on the Number of Feasible Solutio

✍ Thomas A. Lambe 📂 Article 📅 1974 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 307 KB

An improved upper bound for the zero-one

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

A note on 0.5-bounded greedy algorithms

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