✦ LIBER ✦

Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions

✍ Scribed by M. Dawande; J. Kalagnanam; P. Keskinocak; F.S. Salman; R. Ravi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

LP based heuristics for the multiple kna

✍ Geir Dahl; Njål Foldnes 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 346 KB

A successive approximation algorithm for

✍ Zhenbo Wang; Wenxun Xing 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 420 KB

Heuristic algorithms for the multiple kn

✍ S. Martello; P. Toth 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 835 KB

Approximation for knapsack problems with

✍ Li’ang Zhang; Yin Zhang 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 477 KB

Parameterized Approximation Scheme for t

✍ Jansen, Klaus 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 305 KB

A Polynomial Time Approximation Scheme f

✍ Chekuri, Chandra; Khanna, Sanjeev 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 200 KB