The traveling salesperson problem on at most 32 cities. More...

Files
file	TravelingSalesman.h
	Header file for the class TravelingSalesman, which implements the Domain concept [see Domain.h] for the traveling salesperson problem with the minimum spanning tree heuristic of exercise 3.30 of Russell and Norvig, "Artificial Intelligence: A Modern Approach" (3rd edition, 2010).

Classes
class	TravelingSalesman
	the traveling salesperson problem on at most 32 cities More...

Detailed Description

The traveling salesperson problem on at most 32 cities.

Files