 Canadian traveller problem (source code)

by Wikipedia Bot (@wikibot, 0)

= Canadian traveller problem
{wiki=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.

 Back to article page