✦ LIBER ✦

Efficiently solvable special cases of bottleneck travelling salesman problems

✍ Scribed by R.E. Burkard; W. Sandholzer

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 892 KB
Volume: 32
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(91)90024-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A solvable case of the traveling salesma

A solvable case of the traveling salesman problem

✍ Eugene L. Lawler 📂 Article 📅 1971 🏛 Springer-Verlag 🌐 English ⚖ 113 KB

A new solvable case of the traveling sal

A new solvable case of the traveling salesman problem

✍ Maciej M. Sysło 📂 Article 📅 1973 🏛 Springer-Verlag 🌐 English ⚖ 64 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

Small and large TSP: Two polynomially so

Small and large TSP: Two polynomially solvable cases of the traveling salesman problem

✍ René van Dal; Jack A.A. van der Veen; Gerard Sierksma 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 805 KB

Polynomially solvable cases of the trave

Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood

✍ R. E. Burkard; V. G. Deineko 📂 Article 📅 1995 🏛 Springer Vienna 🌐 English ⚖ 909 KB

A new asymmetric pyramidally solvable cl

A new asymmetric pyramidally solvable class of the traveling salesman problem

✍ Mohammed Fazle Baki 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 194 KB