✦ LIBER ✦

A distributed implementation of simulated annealing for the travelling salesman problem

✍ Scribed by James R.A Allwright; D.B Carpenter

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 230 KB
Volume: 10
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(89)90106-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational implementation of a combin

Computational implementation of a combined branch and bound algorithm for the travelling-salesman problem

✍ I.Kh. Sigal 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 588 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

A search algorithm for the traveling sal

A search algorithm for the traveling salesman problem

✍ Jatinder N.D. Gupta 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 713 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

A simulated annealing artificial neural

A simulated annealing artificial neural network implementation of the n-queens problem

✍ T. Tambouratzis 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB 👁 2 views

A Harmony Theory artificial neural network implementation of the n-queens problem is presented in this piece of research. The problem is encoded in the two layers of the artificial neural network in such a manner that the inherent constraints of the problem are made directly available. Subsequently,

A modification of the dynamic programmin

A modification of the dynamic programming method for the travelling-salesman problem

✍ L.N. Korotayeva; A.N. Sesekin; A.G. Chentsov 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 371 KB