✦ LIBER ✦

Kürzeste Rundreise zwischen n Orten (Travelling Salesman Problem)

✍ Scribed by W. Knödel

Book ID: 105522967
Publisher: Springer Vienna
Year: 1968
Tongue: English
Weight: 183 KB
Volume: 3
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02277457

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Revidierte Fassung Von Algorithmus 7 Kür

Revidierte Fassung Von Algorithmus 7 Kürzeste Rundreise zwischen n Orten (Travelling Salesman Problem)

✍ E. Hausch; W. Knödel 📂 Article 📅 1970 🏛 Springer Vienna 🌐 English ⚖ 208 KB

Generalized travelling salesman problem

Generalized travelling salesman problem through n sets of nodes: the asymmetrical case

✍ Gilbert Laporte; Hélène Mercure; Yves Nobert 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 748 KB

Heuristic approaches to the asymmetric t

Heuristic approaches to the asymmetric travelling salesman problem with replenishment arcs

✍ V. Mak; N. Boland 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

The Kohonen network incorporating explic

The Kohonen network incorporating explicit statistics and its application to the travelling salesman problem

✍ N. Aras; B.J. Oommen; İ.K. Altınel 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 193 KB

In this paper we introduce a new self-organizing neural network, the Kohonen Network Incorporating Explicit Statistics (KNIES) that is based on Kohonen's Self-Organizing Map (SOM). The primary difference between the SOM and the KNIES is the fact that every iteration in the training phase includes tw

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computational Methods in Neural Modeling Volume 2686 || An N-Parallel Multivalued Network: Applications to the Travelling Salesman Problem

✍ Mira, José; Álvarez, José R. 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg ⚖ 200 KB