OptimalTSP means Optimal Traveling Salesman Problem. It is a Windows-based application developed to solve the Traveling Salesman Problem (also known as the Hamiltonian Path Problem) in deterministic polynomial time aimed at settling the P vs NP Problem. The application creates both asymmetrical and symmetrical TSP cost or distance matrices, automatically creates the LINGO code for checking the application’s solution, among other features.