Branch and bound method of solving Travelling Salesman Problem

Printer-friendly versionPDF version
This project is archived.

Підтримувані платформи: 

Мови інтерфейсу: 



Application for generating and solving Travelling Salesman Problem tasks. This application was later rewritten from scratch as an Open Source cross-platform Qt-based application TSP Solver and Generator.

Мій внесок: 

This application was written as my University assignment (coursework “Branch and bound method of solving Travelling Salesman Problem”). I needed to make a corrections to the algorithm of already existing application, but I ended up making corrections, additions and redesign of the whole application.



Файл ZKomModRdSetup.exeVersion 2.0 (includes source code)793.85 КБ
Іконка документу Microsoft Office Пояснительная записка.docExplanatory note (in Russian)387.5 КБ