O’ZBEKISTON VILOYATLARI BO’YLAB SAYOHAT UCHUN MINIMAL HARAJATNI TOPISHDA KOMMIVOYAJYOR MASALASI
Keywords:
Masalaning matematik ifodasi, matematik modeli,yechish usullari, qo’llanilish sohalari, masalaning qiyinligi, tarmoqlar va chegaralar usuliAbstract
Yo‘lni optimallashtirish, ya’ni umumiy masofani minimallashtirishdir. Maqsad shunday yo‘l topishki, u barcha shaharlardan bir marta o‘tib, boshlang‘ich shaharga qaytsin va yo‘l uzunligi minimal bo‘lsin.
References
1. To‘xtasinov M. Jarayonlar tadqiqoti
2. Papadimitriou, C. H., & Steiglitz, K. (1998). Combinatorial Optimization: Algorithms and Complexity. Dover Publications.
3. Applegate, D., Bixby, R., Chvátal, V., & Cook, W. (2006). The Traveling Salesman Problem: A Computational Study. Princeton University Press.
4. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley.
5. Gutin, G., & Punnen, A. P. (2002). The Traveling Salesman Problem and Its Variations. Springer.
6. Reinelt, G. (1994). The Traveling Salesman: Computational Solutions for TSP Applications. Springer.
