traveling salesman problem

GPTKB entity

Predicate	Object
gptkbp:instanceOf	mathematical optimization
gptkbp:abbreviation	gptkb:TSP
gptkbp:complexity	gptkb:NP-hard
gptkbp:definedIn	the problem of finding the shortest possible route that visits each city exactly once and returns to the origin city
gptkbp:estimatedCost	yes
gptkbp:field	gptkb:mathematics computer science operations research
gptkbp:hasApplication	gptkb:astronomy manufacturing robotics telecommunications supply chain management route planning scheduling genome sequencing delivery services network design drone delivery data clustering tour planning vehicle routing PCB manufacturing logistics optimization airline scheduling
gptkbp:hasExactAlgorithm	yes
gptkbp:hasVariant	gptkb:Euclidean_TSP gptkb:asymmetric_TSP gptkb:metric_TSP multiple traveling salesman problem
https://www.w3.org/2000/01/rdf-schema#label	traveling salesman problem
gptkbp:notableContributor	gptkb:Richard_Karp gptkb:William_Rowan_Hamilton gptkb:Karl_Menger gptkb:Dantzig,_Fulkerson,_and_Johnson
gptkbp:relatedTo	gptkb:Hamiltonian_cycle_problem gptkb:vehicle_routing_problem gptkb:Chinese_postman_problem
gptkbp:solvedBy	gptkb:simulated_annealing gptkb:genetic_algorithms gptkb:Christofides_algorithm dynamic programming branch and bound nearest neighbor heuristic
gptkbp:studiedBy	1930s
gptkbp:usedIn	logistics planning DNA sequencing circuit design
gptkbp:bfsParent	gptkb:Hamiltonian_cycle gptkb:Hamiltonian_path gptkb:Hamiltonian_graph
gptkbp:bfsLayer	5