Traveling Salesman Problem

The traveling salesman's problem is one of the most famous problems of combinatorial optimization, which consists in finding the most profitable route passing through these points at least once and then returning to the starting point. In the bottom application, the method of branches and boundaries is used to solve the problem

Application Features
- Special keyboard for more convenient data entry;
- Full, step by step description of solutions;
- Ability to save decisions;
- Ability to edit saved solutions
- Works without access to the Internet

Keywords: Matrix games,
special maths, simplex method,
the traveling salesman problem, the dual task,
dynamic programming, dynamic planning,
resource allocation