✦ LIBER ✦

Efficient algorithms for the double traveling salesman problem with multiple stacks

✍ Scribed by Marco Casazza; Alberto Ceselli; Marc Nunkesser

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New neighborhood structures for the Doub

✍ A. Felipe; M. T. Ortuño; G. Tirado 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 461 KB

Exact solutions to the double travelling

✍ Hanne L. Petersen; Claudia Archetti; M. Grazia Speranza 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 227 KB

A branch-and-bound algorithm for the dou

✍ Francesco Carrabs; Raffaele Cerulli; Maria Grazia Speranza 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 672 KB

Approximation algorithms for the traveli

✍ Jérôme Monnot; Vangelis Th. Paschos; Sophie Toulouse 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 200 KB

Large neighborhood search for the pickup

✍ Jean-François Côté; Michel Gendreau; Jean-Yves Potvin 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 152 KB

Implementation analysis of efficient heu

✍ Dorabela Gamboa; César Rego; Fred Glover 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 241 KB