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

詳細記述

書誌詳細

主要な著者:	M. P. Revotjuk, M. K. Qaraleh, P. M. Batura
フォーマット:	Artigo
言語:	Russo
出版事項:	Educational institution «Belarusian State University of Informatics and Radioelectronics» 2019-06-01
シリーズ:	Доклады Белорусского государственного университета информатики и радиоэлектроники
主題:	задача коммивояжера метод ветвей и границ вычислительная сложность
オンライン･アクセス:	https://doklady.bsuir.by/jour/article/view/234
タグ:	タグ追加 タグなし, このレコードへの初めてのタグを付けませんか!