traveling salesman problem
E1335240
UNEXPLORED
The traveling salesman problem is a classic NP-hard optimization problem that asks for the shortest possible route visiting each city exactly once and returning to the starting point.
All labels observed (4)
| Label | Occurrences |
|---|---|
| Traveling Salesman | 1 |
| Traveling Salesman problem (decision version) | 1 |
| traveling salesman problem canonical | 1 |
| traveling salesman problem (optimization version) is NP-hard | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T18628468 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: traveling salesman problem Context triple: [Hamiltonian cycle, usedIn, traveling salesman problem]
-
A.
TSP
TSP is a structured framework that guides software development teams in planning, tracking, and improving their work to produce high-quality software.
-
B.
TSP
TSP is the commonly used abbreviation and nickname for the Polish football club TS Podbeskidzie Bielsko-Biała.
-
C.
TSP
TSP refers to the Terrorist Surveillance Program, a controversial post-9/11 U.S. National Security Agency initiative involving warrantless electronic eavesdropping on communications suspected of links to terrorism.
-
D.
TSP
TSP is the commonly used abbreviation for the Taconic State Parkway, a major scenic highway running through eastern New York State.
-
E.
TSP
TSP is a U.S. federal government-sponsored retirement savings and investment plan for federal employees and members of the uniformed services.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: traveling salesman problem Target entity description: The traveling salesman problem is a classic NP-hard optimization problem that asks for the shortest possible route visiting each city exactly once and returning to the starting point.
-
A.
TSP
TSP is a structured framework that guides software development teams in planning, tracking, and improving their work to produce high-quality software.
-
B.
TSP
TSP is the commonly used abbreviation and nickname for the Polish football club TS Podbeskidzie Bielsko-Biała.
-
C.
TSP
TSP refers to the Terrorist Surveillance Program, a controversial post-9/11 U.S. National Security Agency initiative involving warrantless electronic eavesdropping on communications suspected of links to terrorism.
-
D.
TSP
TSP is the commonly used abbreviation for the Taconic State Parkway, a major scenic highway running through eastern New York State.
-
E.
TSP
TSP is a U.S. federal government-sponsored retirement savings and investment plan for federal employees and members of the uniformed services.
- F. None of above. chosen
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.
subject linked to:
Hamiltonian cycle concept
linked to: traveling salesman problem
Reducibility Among Combinatorial Problems
→
establishesNPCompletenessOf
→
Traveling Salesman problem (decision version)
ⓘ
subject linked to:
"Reducibility Among Combinatorial Problems" (1972)
linked to: traveling salesman problem
linked to: traveling salesman problem