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

Descrizione completa

Dettagli Bibliografici

Autori principali:	M. P. Revotjuk, M. K. Qaraleh, P. M. Batura
Natura:	Artigo
Lingua:	Russo
Pubblicazione:	Educational institution «Belarusian State University of Informatics and Radioelectronics» 2019-06-01
Serie:	Доклады Белорусского государственного университета информатики и радиоэлектроники
Soggetti:	задача коммивояжера метод ветвей и границ вычислительная сложность
Accesso online:	https://doklady.bsuir.by/jour/article/view/234
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!