(mathematics) The problem of performing successively a number of tasks, represented by vertices of a graph, with the least expenditure on transitions from one task to another, represented by edges of the graph with journey costs attached.
traveling salesman problem
| Sci-Tech Dictionary: traveling salesman problem |
(¦trav·əl·iŋ ′sālz·mən ′präb·ləm)
| 5min Related Video: traveling salesman problem |
Learn More
 | brute force programming (technology) |
| brute force (computer jargon) |
| Lin-Kernighan |
Help us answer these
 | What are the differences between chinese postman problem and travelling salesman problem? |
| Branch and bound travelling salesman problem? |
| C program to for traveling salesman problem? |
Post a question - any question - to the WikiAnswers community:
Copyrights:
 |
 | Sci-Tech Dictionary. McGraw-Hill Dictionary of Scientific and Technical Terms. Copyright © 2003, 1994, 1989, 1984, 1978, 1976, 1974 by McGraw-Hill Companies, Inc. All rights reserved. Read more |
Related answers
- Is there an algorithm for the Travelling Salesman problem?
- What did the Traveling salesman sell in movie groundhog day?
ADVERTISEMENT
Answer these
- What is travelling salesman problem in graph?
- Definition of traveling salesman problem?
- Examples of travelling salesman problems in AI?
Mentioned in
- brute force programming (technology)
- brute force (computer jargon)
- Lin-Kernighan
- 2-opt
- 3-opt
- Year 1973 (in Science & Technology)
- Set TSP problem
- Merrill M. Flood
- Bottleneck traveling salesman problem
- Year 1988 (in Science & Technology)
- GIS glossary: h-t (technology)
- Richard Wayne Chambliss, Jr.
- Luca Maria Gambardella
- Tabu search
