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

Deskribapen osoa

Xehetasun bibliografikoak

Egile Nagusiak:	M. P. Revotjuk, M. K. Qaraleh, P. M. Batura
Formatua:	Artigo
Hizkuntza:	Russo
Argitaratua:	Educational institution «Belarusian State University of Informatics and Radioelectronics» 2019-06-01
Saila:	Доклады Белорусского государственного университета информатики и радиоэлектроники
Gaiak:	задача коммивояжера метод ветвей и границ вычислительная сложность
Sarrera elektronikoa:	https://doklady.bsuir.by/jour/article/view/234
Etiketak:	Etiketa erantsi Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!