Reference Entry

travelling salesman problem ((in graph theory))

Christopher Clapham and James Nicholson

in The Concise Oxford Dictionary of Mathematics

Fifth edition

Published in print January 2014 | ISBN: 9780199679591
Published online September 2014 | e-ISBN: 9780191759024
travelling salesman problem ((in graph theory))

Show Summary Details

Preview

This is a situation similar to the *minimum connector problem but the salesman wishes to return to the starting point (home) at the end, and so essentially the problem is to find a closed walk which visits every vertex, and which minimizes the total distance travelled. In practice there can be unusual situations in which the most efficient route is to go ...

Reference Entry.  241 words. 

Subjects: Pure Mathematics

Full text: subscription required

How to subscribe Recommend to my Librarian

Buy this work at Oxford University Press »

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content. subscribe or login to access all content.