## Quick Reference

A network problem that can be formulated as a combinatorial optimization problem. A salesman has to visit a number of interconnected destinations. The problem is to determine the route that minimizes the total distance traveled. *See diagram*.

**Travelling salesman problem.** The route illustrated would be appropriate for a travelling salesman in East Anglia, England.

*Subjects:*
Mathematics — Psychology.

## Related content in Oxford Index

##### Reference entries

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