✦ LIBER ✦

Approximation Algorithms for Multi-Criteria Traveling Salesman Problems

✍ Scribed by Bodo Manthey; L. Shankar Ram

Publisher: Springer
Year: 2007
Tongue: English
Weight: 503 KB
Volume: 53
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9011-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for the traveli

Approximation algorithms for the traveling salesman problem

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

A heuristic algorithm for traveling sale

A heuristic algorithm for traveling salesman problems

✍ Said Ashour; J.F. Vega; R.G. Parker 📂 Article 📅 1972 🏛 Elsevier Science ⚖ 685 KB

Algorithms for solving the travelling sa

Algorithms for solving the travelling salesman problems

✍ Yu. A. Zak 📂 Article 📅 1974 🏛 Springer US 🌐 English ⚖ 639 KB

Probabilistic exchange algorithms and Eu

Probabilistic exchange algorithms and Euclidean traveling salesman problems

✍ Y. Rossier; M. Troyon; Th. M. Liebling 📂 Article 📅 1986 🏛 Springer 🌐 German ⚖ 918 KB

Approximation algorithms for the capacit

Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries

✍ Shoshana Anily; Julien Bramel 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB 👁 2 views

We consider the Capacitated Traveling Salesman Problem with Pickups and Deliveries (CTSPPD). This problem is characterized by a set of n pickup points and a set of n delivery points. A single product is available at the pickup points which must be brought to the delivery points. A vehicle of limited

Approximation Algorithms with Bounded Pe

Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman Problem

✍ N. Guttmann-Beck; R. Hassin; S. Khuller; B. Raghavachari 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 111 KB