✦ LIBER ✦

A quantitative analysis of the simulated annealing algorithm: A case study for the traveling salesman problem

✍ Scribed by Emile H. L. Aarts; Jan H. M. Korst; Peter J. M. van Laarhoven

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A distributed implementation of simulate

✍ James R.A Allwright; D.B Carpenter 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 230 KB

A search algorithm for the traveling sal

✍ Jatinder N.D. Gupta 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 713 KB

A worst-case analysis of two approximate

✍ Giovanni Righini; Marco Trubian 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 251 KB

A solvable case of the traveling salesma

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

A parallel 2-opt algorithm for the Trave

✍ M.G.A. Verhoeven; E.H.L. Aarts; P.C.J. Swinkels 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 823 KB

A new solvable case of the traveling sal

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