✦ LIBER ✦

A strongly polynomial FPTAS for the symmetric quadratic knapsack problem

✍ Scribed by Zhou Xu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The symmetric quadratic knapsack problem

✍ Kellerer, Hans; Strusevich, Vitaly A. 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 541 KB

A Newton’s method for the continuous qua

✍ Cominetti, Roberto; Mascarenhas, Walter F.; Silva, Paulo J. S. 📂 Article 📅 2014 🏛 Springer-Verlag 🌐 English ⚖ 306 KB

A Polynomial Time Approximation Scheme f

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

A strongly polynomial algorithm for the

✍ P. Kleinschmidt; H. Schannath 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 777 KB

A New Fully Polynomial Time Approximatio

✍ Hans Kellerer; Ulrich Pferschy 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 76 KB

A fully polynomial approximation algorit

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