✦ LIBER ✦

Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints

✍ Scribed by Aristide Mingozzi, Lucio Bianco and Salvatore Ricciardelli

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A travelling salesman problem with alloc

✍ K. Fagerholt; M. Christiansen 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB

A travelling salesman problem with alloc

✍ Kjetil Fagerholt; Marielle Christiansen 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB

A Branch & Cut Algorithm for the Asymmet

✍ Norbert Ascheuer; Michael Jünger; Gerhard Reinelt 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 325 KB

A restricted dynamic programming heurist

✍ Chryssi Malandraki; Robert B. Dial 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 762 KB

New tighter polynomial length formulatio

✍ Subhash C. Sarin; Hanif D. Sherali; Ajay Bhootra 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 222 KB

An Optimal Algorithm for the Traveling S

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