✦ LIBER ✦

A multi-agent approach for solving traveling salesman problem

✍ Scribed by Zhou Tiejun; Tan Yihong; Xing Lining

Publisher: Wuhan University
Year: 2006
Tongue: English
Weight: 540 KB
Volume: 11
Category: Article
ISSN: 1007-1202
DOI: 10.1007/bf02829218

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A heuristic circulation-network approach

A heuristic circulation-network approach to solve the multi-traveling salesman problem

✍ Alberto Garcia-Diaz 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 561 KB

The overall methodology developed in this paper can be organized into two major parts. The first part consists of a representation of the Multi-Traveling Salesman Problem as a network circulation model. The second part is a subtour elimination procedure. The circulation-network representation of the

Algorithms for solving the travelling sa

Algorithms for solving the travelling salesman problems

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

The traveling salesman problem: A dualit

The traveling salesman problem: A duality approach

✍ Mokhtar S. Bazaraa; Jamie J. Goode 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 769 KB

Approximation Algorithms for Multi-Crite

Approximation Algorithms for Multi-Criteria Traveling Salesman Problems

✍ Bodo Manthey; L. Shankar Ram 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 503 KB

Probabilistic analysis of solving the as

Probabilistic analysis of solving the assignment problem for the traveling salesman problem

✍ J.-C. Panayiotopoulos 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 432 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