✦ LIBER ✦

Minisum location of a travelling salesman on simple networks

✍ Scribed by O. Berman; D. Simchi-Levi

Book ID: 107991961
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 567 KB
Volume: 36
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(88)90430-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minisum location of a traveling salesman

✍ O. Berman; D. Simchi Levi 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 530 KB

A cutting plane procedure for the travel

A cutting plane procedure for the travelling salesman problem on road networks

✍ Bernhard Fleischmann 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 869 KB

On a solution of the travelling salesman

On a solution of the travelling salesman problem

✍ L.A. Pchelintsev 📂 Article 📅 1966 🏛 Elsevier Science ⚖ 263 KB

Simple multistage location problem on a

Simple multistage location problem on a treelike network

✍ V. A. Trubin; F. A. Sharifov 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 413 KB

Minisum and minimax paths of a moving fa

Minisum and minimax paths of a moving facility on a network

✍ Seong-in Kim; Hanif D. Sherali; Heung-Sun Park 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 805 KB

A study of the application of Kohonen-ty

A study of the application of Kohonen-type neural networks to the Travelling Salesman Problem

✍ F. Favata; R. Walker 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 610 KB

It is observed that animals often have to resolve difficult tasks of optimization and that this process can be studied by applying the formal framework of neural networks to a simple problem such as the Travelling Salesman Problem. Existing work is reviewed with particular emphasis on recent studies