✦ LIBER ✦

A local search heuristic for the Multi-Commodity(k)-splittable Maximum Flow Problem

✍ Scribed by M. Gamst

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comparing branch-and-price algorithms fo

✍ M. Gamst; B. Petersen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 246 KB

A fast heuristic algorithm for the maxim

✍ Massimiliano Caramia; Antonino Sgalambro 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 300 KB

A polynomial time approximation algorith

✍ Elke Eisenschmidt, Utz-Uwe Haus 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 305 KB

Beam search heuristics for the single an

✍ Hakan Akyüz, M.; Öncan, Temel; Kuban Altınel, İ. 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 580 KB

A Branch and Price algorithm for the -sp

✍ Jérôme Truffot; Christophe Duhamel 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 805 KB

A tree search algorithm for the multi-co

✍ Richard S. Laundy 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 523 KB