CPSolver.Examples.TSP (Fixpoint v0.8.30)
Summary
Functions
Link to this function
check_solution(solution, model)
Link to this function
hamiltonian?(sequence)
Link to this function
model(data)
Link to this function
parse_instance(filename)
Link to this function
run(instance, opts \\ [])
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
search(model)
Link to this function
solution_handler(model)
Link to this function
to_dot(distances)
Link to this function