Canadian traveller problem
ID: canadian-traveller-problem
The Canadian Traveller Problem (CTP) is a combinatorial optimization problem that extends the classic Travelling Salesman Problem (TSP). It arises in scenarios where a traveller must visit a set of locations (cities or nodes) while adhering to certain constraints.
New to topics? Read the docs here!