✦ LIBER ✦

An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem

✍ Scribed by E. Mérida-Casermeiro; G. Galán-Marín; J. Muñoz-Pérez

Book ID: 110316272
Publisher: Springer US
Year: 2001
Tongue: English
Weight: 114 KB
Volume: 14
Category: Article
ISSN: 1370-4621
DOI: 10.1023/a:1012751230791

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient heuristic algorithm for the

An efficient heuristic algorithm for the bottleneck traveling salesman problem

✍ Ravi Ramakrishnan; Prabha Sharma; Abraham P. Punnen 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 407 KB

An efficient procedure for the N-city tr

An efficient procedure for the N-city traveling salesman problem

✍ B.R. Feiring 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 232 KB

An efficient hybrid genetic algorithm fo

An efficient hybrid genetic algorithm for the traveling salesman problem

✍ Kengo Katayama; Hiroyuki Narihisa 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB 👁 2 views

An expanding self-organizing neural netw

An expanding self-organizing neural network for the traveling salesman problem

✍ Kwong-Sak Leung; Hui-Dong Jin; Zong-Ben Xu 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 411 KB

An efficient composite heuristic for the

An efficient composite heuristic for the symmetric generalized traveling salesman problem

✍ Jacques Renaud; Fayez F. Boctor 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 1014 KB

The main purpose of this paper is to introduce a new composite heuristic for solving the generalized traveling salesman problem. The proposed heuristic is composed of three phases: the construction of an initial partial solution, the insertion of a node from each non-visited node-subset, and a solut

An Algorithm for the Traveling Salesman

An Algorithm for the Traveling Salesman Problem

✍ Little, John D. C.; Murty, Katta G.; Sweeney, Dura W.; Karel, Caroline 📂 Article 📅 1963 🏛 INFORMS 🌐 English ⚖ 733 KB