✦ LIBER ✦

On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem

✍ Scribed by Frank Korner

Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 249 KB
Volume: 26
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(86)90188-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An approximation algorithm for the asymm

An approximation algorithm for the asymmetric travelling salesman problem with distances one and two

✍ Sundar Vishwanathan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 501 KB

On approximation algorithms for the mini

On approximation algorithms for the minimum satisfiability problem

✍ M.V. Marathe; S.S. Ravi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 617 KB

On the worst-case performance of some al

On the worst-case performance of some algorithms for the asymmetric traveling salesman problem

✍ A. M. Frieze; G. Galbiati; F. Maffioli 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 657 KB

A worst-case analysis of two approximate

A worst-case analysis of two approximate algorithms for the asymmetric travelling salesman problem

✍ Giovanni Righini; Marco Trubian 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 251 KB

A modification of the algorithm for solv

A modification of the algorithm for solving the travelling salesman problem

✍ L.N. Volovik; B.Ya. Skachek 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 730 KB