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

Descripció completa

Dades bibliogràfiques

Autors principals:	M. P. Revotjuk, M. K. Qaraleh, P. M. Batura
Format:	Artigo
Idioma:	Russo
Publicat:	Educational institution «Belarusian State University of Informatics and Radioelectronics» 2019-06-01
Col·lecció:	Доклады Белорусского государственного университета информатики и радиоэлектроники
Matèries:	задача коммивояжера метод ветвей и границ вычислительная сложность
Accés en línia:	https://doklady.bsuir.by/jour/article/view/234
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!