Decision of the traveling salesman problem by method of integer programming. Branch and bound method

In article, the method of integer programming for the solution of a travelling salesman problem is considered. The program is based on a method of branches and boundaries is realized. Assessment of program applicability of a method, speed of its operation and complexity of implementation is made. The example of result of a program runtime is given.