✦ LIBER ✦

A method of solving the travelling salesman problem with the help of integer programming: The problem of finding Hamilton paths of the shortest length in a complete graph

✍ Scribed by V.I. Mudrov

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A modification of the dynamic programmin

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

A note on dual solutions of the assignme

✍ Bernd Jeromin; Frank Körner 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 212 KB

A mean-time comparison of algorithms for

✍ W. D. Kelton; A. M. Law 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 522 KB

Determination of the physical scattering

✍ Z. Basrak 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 550 KB

A special case of the n-vertex traveling

✍ James K. Park 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 995 KB

A resource allocation problem with the a

✍ Abraham Mehrez 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 458 KB