✦ LIBER ✦

Approximation algorithms on 0–1 linear knapsack problem with a single continuous variable

✍ Scribed by Zhao, Chenxia; Li, Xianyue

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The 0-1 Knapsack problem with a single c

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

An exact algorithm for the 0–1 linear kn

✍ Geng Lin; Wenxing Zhu; M. M. Ali 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 246 KB

A fully polynomial approximation algorit

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

A note on 0.5-bounded greedy algorithms

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

0-1 Quadratic Knapsack Problems: An Exac

✍ Rodrigues, C. D.; Quadri, D.; Michelon, P.; Gueye, S. 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 284 KB

On the Dietrich-Escudero approach for so

✍ L.F. Escudero; G. Pérez; A. Garin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 75 KB