Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:abbreviation |
ATSP
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:fullName |
asymmetric traveling salesman problem
|
| gptkbp:generalizes |
gptkb:traveling_salesman_problem
|
| gptkbp:hasApplication |
logistics
routing circuit design |
| gptkbp:hasProperty |
edge costs are not symmetric
|
| gptkbp:hasSolutionMethod |
heuristics
approximation algorithms integer programming branch and bound |
| https://www.w3.org/2000/01/rdf-schema#label |
asymmetric TSP
|
| gptkbp:input |
graph
cost matrix |
| gptkbp:objective |
find minimum-cost Hamiltonian circuit
|
| gptkbp:relatedTo |
gptkb:traveling_salesman_problem
|
| gptkbp:studiedBy |
20th century
|
| gptkbp:studiedIn |
operations research
theoretical computer science |
| gptkbp:bfsParent |
gptkb:traveling_salesman_problem
|
| gptkbp:bfsLayer |
6
|