✦ LIBER ✦

Local branching-based algorithms for the disjunctively constrained knapsack problem

✍ Scribed by Hakim Akeb; Mhand Hifi; Mohamed Elhafedh Ould Ahmed Mounir

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cost Based Filtering for the Constrained

✍ Torsten Fahle; Meinolf Sellmann 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 188 KB

Heuristic and Exact Algorithms for the P

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

Clique-based facets for the precedence c

✍ Natashia Boland, Andreas Bley, Christopher Fricke, Gary Froyland, Renata Sotirov 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 643 KB

A recursive branch and bound algorithm f

✍ Arne Thesen 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 655 KB

Dynamic programming based algorithms for

✍ Aiying Rong; José Rui Figueira; Kathrin Klamroth 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 367 KB

A branch and bound algorithm for solving

✍ M.E. Dyer; N. Kayal; J. Walker 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 865 KB