✦ LIBER ✦

Cost Based Filtering for the Constrained Knapsack Problem

✍ Scribed by Torsten Fahle; Meinolf Sellmann

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Clique-based facets for the precedence c

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

Local branching-based algorithms for the

✍ Hakim Akeb; Mhand Hifi; Mohamed Elhafedh Ould Ahmed Mounir 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 338 KB

Lifting valid inequalities for the prece

✍ R.L.M.J. van de Leensel; C.P.M. van Hoesel; J.J. van de Klundert 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 163 KB

Heuristic and Exact Algorithms for the P

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

A polyhedral study of the cardinality co

✍ I.R. de Farias Jr; G.L. Nemhauser 📂 Article 📅 2003 🏛 Springer-Verlag 🌐 English ⚖ 264 KB

A robust approach to the chance-constrai

✍ Olivier Klopfenstein; Dritan Nace 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 549 KB