Branch and bound method of solving Travelling Salesman Problem [1]
Підтримувані платформи:
- Windows
Мови інтерфейсу:
- Русский
Технології:
- Pascal
- Delphi
Опис:
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 [2].
Мій внесок:
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.
Скріншоти:
