IMPLEMENTATION The branch and bound method for solving The traveling salesman problem with sparse matrix

Abstract

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 of the new solution on branch’s tree path. The reoptimization algorithm, based on a Shortest Augmenting Path method, is offered.

Keywords

• задача коммивояжера
• метод ветвей и границ
• вычислительная сложность