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

Ausführliche Beschreibung

Bibliografische Detailangaben

Hauptverfasser:	M. P. Revotjuk, M. K. Qaraleh, P. M. Batura
Format:	Artigo
Sprache:	Russo
Veröffentlicht:	Educational institution «Belarusian State University of Informatics and Radioelectronics» 2019-06-01
Schriftenreihe:	Доклады Белорусского государственного университета информатики и радиоэлектроники
Schlagworte:	задача коммивояжера метод ветвей и границ вычислительная сложность
Online-Zugang:	https://doklady.bsuir.by/jour/article/view/234
Tags:	Tag hinzufügen Keine Tags, Fügen Sie das erste Tag hinzu!