Revotjuk, M. P., Qaraleh, M. K., & Batura, P. M. (2019). IMPLEMENTATION The branch and bound method for solving The traveling salesman problem with sparse matrix. Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki, 7, 25-31.
Chicago-referens (17:e uppl.)Revotjuk, M. P., M. K. Qaraleh, och P. M. Batura. "IMPLEMENTATION The Branch and Bound Method for Solving The Traveling Salesman Problem with Sparse Matrix." Doklady Belorusskogo Gosudarstvennogo Universiteta Informatiki I Radioèlektroniki 7 (2019): 25-31.
MLA-referens (9:e uppl.)Revotjuk, M. P., et al. "IMPLEMENTATION The Branch and Bound Method for Solving The Traveling Salesman Problem with Sparse Matrix." Doklady Belorusskogo Gosudarstvennogo Universiteta Informatiki I Radioèlektroniki, 7, 2019, pp. 25-31.
