✦ LIBER ✦

The Shortest-Path Problem with Resource Constraints and k -Cycle Elimination for k ≥ 3

✍ Scribed by Irnich, Stefan; Villeneuve, Daniel

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The shortest-path problem with resource

✍ Bode, Claudia; Irnich, Stefan 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 705 KB

Improved algorithms for the k simple sho

✍ Zvi Gotthilf; Moshe Lewenstein 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Labelling algorithms for the elementary

✍ Michael Drexl; Eric Prescott-Gagnon 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 639 KB

An exact algorithm for the elementary sh

✍ Dominique Feillet; Pierre Dejax; Michel Gendreau; Cyrille Gueguen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

Valid inequalities and lifting procedure

✍ Ibrahim, M. S.; Maculan, N.; Minoux, M. 📂 Article 📅 2014 🏛 Springer-Verlag 🌐 English ⚖ 219 KB

Enhanced compact models for the connecte

✍ Haouari, Mohamed; Maculan, Nelson; Mrad, Mehdi 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 295 KB