traveling salesman problem
traveling salesman problem (TSP) A well-known graph-searching problem. In practical terms the problem can be thought of as that of a salesman who wishes to perform a circular tour of certain cities, calling at each city once only and traveling the minimum total distance possible. In more abstract terms, it is the problem of finding a minimum-weight Hamiltonian cycle in a weighted graph. The problem is known to be NP-complete (see P=NP question).
More From encyclopedia.com
Problem Solving , A managerial problem can be described as the gap between a given current state of affairs and a future desired state. Problem solving may then be tho… Social Problems , The discipline of sociology was born during a century of rapid social change attributable largely to the Industrial Revolution. Social theorists in n… Formula Weight , form. wt Chem. formula weight Diet Industry , 175 Crossways Park West
Woodbury, New York 11797
U.S.A.
Telephone: (516) 390-1400
Toll Free: (800) 651-6000
Fax: (516) 390-1334
Web site: http://www.… avoirdupois , av·oir·du·pois / ˌävərdəˈpoiz/ • n. a system of weights based on a pound of 16 ounces or 7,000 grains, widely used in English-speaking countries: [as… Overweight , Overweight
The term overweight is used to describe an excess amount of total body weight including all tissues (fat, bone, muscle, etc.) and water. O…
You Might Also Like
NEARBY TERMS
traveling salesman problem