✦ LIBER ✦

Neurodynamic programming: a case study of the traveling salesman problem

✍ Scribed by Jia Ma; Tao Yang; Zeng-Guang Hou; Min Tan; Derong Liu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A solvable case of the traveling salesma

✍ Eugene L. Lawler 📂 Article 📅 1971 🏛 Springer-Verlag 🌐 English ⚖ 113 KB

A new solvable case of the traveling sal

✍ Maciej M. Sysło 📂 Article 📅 1973 🏛 Springer-Verlag 🌐 English ⚖ 64 KB

Quantizers and the worst-case Euclidean

✍ Luis A. Goddyn 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 888 KB

A bilevel programming approach to the tr

✍ Patrice Marcotte; Gilles Savard; Frédéric Semet 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 226 KB

A quantitative analysis of the simulated

✍ Emile H. L. Aarts; Jan H. M. Korst; Peter J. M. van Laarhoven 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 1013 KB

A restricted dynamic programming heurist

✍ Chryssi Malandraki; Robert B. Dial 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 762 KB