IMPLEMENTATION The branch and bound method for solving The traveling salesman problem with sparse matrix

The problem of the solution of asymmetric traveling salesman problem with sparse matrix, based on branch and bound techniques with linear assignment problems relaxation, is considered. Inheritance of the result’s data of previous problems and its reoptimization allows to decreasing time of reception...

全面介紹

書目詳細資料
發表在:Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki
Main Authors: M. P. Revotjuk, M. K. Qaraleh, P. M. Batura
格式: Article
語言:俄语
出版: Educational institution «Belarusian State University of Informatics and Radioelectronics» 2019-06-01
主題:
在線閱讀:https://doklady.bsuir.by/jour/article/view/234

相似書籍