CPSolver.Examples.TSP (Fixpoint v0.8.8)
Summary
Functions
The Traveling Salesman problem. Given:
Functions
Link to this function
check_solution(solution, model)
Link to this function
model(data)
The Traveling Salesman problem. Given:
- a set of n locations;
- for each pair of locations, a distance between them.
Find the shortest possible route that visits each location exactly once and returns to the origin location.
Wikipedia
Link to this function
parse_instance(filename)
Link to this function