✦ LIBER ✦

Maximizing traveling salesman problem for special matrices

✍ Scribed by D. Blokh; G. Gutin

Book ID: 104183056
Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 249 KB
Volume: 56
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)00074-n

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Classes of matrices for the traveling sa

Classes of matrices for the traveling salesman problem

✍ Richard H. Warren 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 626 KB

Special cases of the traveling salesman

Special cases of the traveling salesman problem

✍ Richard H. Warren 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 381 KB

The Travelling Salesman Problem on Permu

The Travelling Salesman Problem on Permuted Monge Matrices

✍ Rainer E. Burkard; Vladimir G. Deineko; Gerhard J. Woeginger 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 115 KB

Robotic-Cell Scheduling: Special Polynom

Robotic-Cell Scheduling: Special Polynomially Solvable Cases of the Traveling Salesman Problem on Permuted Monge Matrices

✍ Vladimir G. Deineko; George Steiner; Zhihui Xue 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 799 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

GENI Ants for the Traveling Salesman Pro

GENI Ants for the Traveling Salesman Problem

✍ François-Xavier Le Louarn; Michel Gendreau; Jean-Yves Potvin 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 118 KB