✦ LIBER ✦

Exact Algorithm for Concave Knapsack Problems: Linear Underestimation and Partition Method

✍ Scribed by X. L. Sun; F. L. Wang; D. Li

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity Results and Exact Algorithms

✍ TallaÂ Nobibon, Fabrice; Leus, Roel 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 607 KB

Subadditive lifting methods for partitio

✍ Ellis L Johnson 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 925 KB

Heuristic and Exact Algorithms for the P

✍ N. Samphaiboon; Y. Yamada 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 150 KB

An exact algorithm for the 0–1 linear kn

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

Advanced greedy algorithms and surrogate

✍ Glover, Fred 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 514 KB

New upper bounds and exact methods for t

✍ Hifi, Mhand; Wu, Lei 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 348 KB