CPSolver.Examples.TSP (Fixpoint v0.10.2)

Summary

Functions

check_solution(solution, model)

hamiltonian?(sequence)

model(data)

parse_instance(filename)

run(instance, opts \\ [])

The Traveling Salesman problem. Given

search(model)

solution_handler(model)

to_dot(distances)

to_route(solution, model)

Functions

check_solution(solution, model)

hamiltonian?(sequence)

model(data)

parse_instance(filename)

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.

search(model)

solution_handler(model)

to_dot(distances)

to_route(solution, model)