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...

Descrición completa

Detalles Bibliográficos

Principais autores:	M. P. Revotjuk, M. K. Qaraleh, P. M. Batura
Formato:	Artigo
Idioma:	Russo
Publicado:	Educational institution «Belarusian State University of Informatics and Radioelectronics» 2019-06-01
Series:	Доклады Белорусского государственного университета информатики и радиоэлектроники
Assuntos:	задача коммивояжера метод ветвей и границ вычислительная сложность
Acceso en liña:	https://doklady.bsuir.by/jour/article/view/234
Tags:	Engadir etiqueta Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!