✦ LIBER ✦

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

✍ Scribed by A. M. Frieze; G. Galbiati; F. Maffioli

Publisher: John Wiley and Sons
Year: 1982
Tongue: English
Weight: 657 KB
Volume: 12
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230120103

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On extended formulations for the precede

On extended formulations for the precedence constrained asymmetric traveling salesman problem

✍ L. Gouveia; P. Pesneau 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 177 KB

On the worst-case performance of some he

On the worst-case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints

✍ Marius M. Solomon 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 607 KB

Worst-case analysis of local search heur

Worst-case analysis of local search heuristics for the one-machine total tardiness problem

✍ Shiwei Chang; Hirofumi Matsuo; Guochun Tang 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 538 KB