✦ LIBER ✦

The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization

✍ Scribed by López-Ibáñez, Manuel; Blum, Christian; Ohlmann, Jeffrey W.; Thomas, Barrett W.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Optimal Algorithm for the Traveling S

✍ Dumas, Yvan; Desrosiers, Jacques; Gelinas, Eric; Solomon, Marius M. 📂 Article 📅 1995 🏛 INFORMS 🌐 English ⚖ 538 KB

An Optimal Algorithm for the Traveling S

✍ Dumas, Yvan; Desrosiers, Jacques; Gelinas, Eric; Solomon, Marius M. 📂 Article 📅 1995 🏛 INFORMS 🌐 English ⚖ 538 KB

An Optimal Algorithm for the Traveling S

✍ Yvan Dumas, Jacques Desrosiers, Eric Gelinas and Marius M. Solomon 📂 Article 📅 1995 🏛 INFORMS 🌐 English ⚖ 254 KB

The probabilistic traveling salesman pro

✍ Stacy A. Voccia, Ann M. Campbell… 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 600 KB

A two-commodity flow formulation for the

✍ André Langevin; Martin Desrochers; Jacques Desrosiers; Sylvie Gélinas; Fraňlois 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 770 KB

A variable iterated greedy algorithm for

✍ Karabulut, Korhan (author);Fatih Tasgetiren, M. (author) 📂 Article 📅 2014 🏛 Elsevier Inc. 🌐 English ⚖ 357 KB