Solving the Salesman Problem through Branch and Bound and Linear Programming
The salesman problem (TSP) is a classic NP-hard problem in computer science. It is widely accepted (although not proved) that TSP cannot be solved in polynomial time by deterministic systems.
This projects aims to solve TSP by combining combinatorial optimization (Branch and Bound) with operations research (Linear Programming)
The LP solving is done through the GLPK library