✦ LIBER ✦

Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem

✍ Scribed by D. Karapetyan; G. Gutin

Book ID: 113584012
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 594 KB
Volume: 219
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2012.01.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient neighborhood search for the Pr

Efficient neighborhood search for the Probabilistic Pickup and Delivery Travelling Salesman Problem

✍ Patrizia Beraldi; Gianpaolo Ghiani; Gilbert Laporte; Roberto Musmanno 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 90 KB

On the Complexity of Local Search for th

On the Complexity of Local Search for the Traveling Salesman Problem

✍ Papadimitriou, Christos H.; Steiglitz, Kenneth 📂 Article 📅 1977 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 894 KB

A general variable neighborhood search f

A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem

✍ Nenad Mladenović; Dragan Urošević; Saı¨d Hanafi; Aleksandar Ilić 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 738 KB

Sequential and parallel local search for

Sequential and parallel local search for the time-constrained traveling salesman problem

✍ Gerard Kindervater; Jan Karel Lenstra; Martin Savelsbergh 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 1002 KB

Efficient special case algorithms for th

Efficient special case algorithms for the n-line planar traveling salesman problem

✍ M. Cutler 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 482 KB

## Abstract The traveling salesman problem, path, or cycle is NP‐complete. All known exact solutions to this problem are exponential. In the __N‐line planar__ traveling salesman problem the points are on __N__ lines in the plane. In this paper, simple and efficient low‐degree polynomial solutions a

Large neighborhood search for the pickup

Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks

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