Abstract
The Travelling Salesman Problem (TSP) is a combinatorial optimisation problem well studied in computer science, operations research and mathematics. In the most famous variant of the problem a hypothetical salesman has to visit a number of cities, visiting each city only once, before ending the journey at the original starting city. The shortest path, or tour, of cities, amongst all possible tours is the solution to the problem. The problem is of particular interest since the number of candidate solutions increases greatly as n, the number of cities, increases.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Jones, J. (2015). Material Approximation of Combinatorial Optimisation. In: From Pattern Formation to Material Computation. Emergence, Complexity and Computation, vol 15. Springer, Cham. https://doi.org/10.1007/978-3-319-16823-4_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-16823-4_9
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16822-7
Online ISBN: 978-3-319-16823-4
eBook Packages: EngineeringEngineering (R0)