Computation of the travelling salesman problem by a shrinking blob
(2013)
Journal Article
The travelling salesman problem (TSP) is a well known and challenging combinatorial optimisation problem. Its computational intractability has attracted a number of heuristic approaches to generate satisfactory, if not optimal, candidate solutions. S... Read More about Computation of the travelling salesman problem by a shrinking blob.