Statements (18)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_optimization
|
| gptkbp:alternativeName |
PC-TSP
|
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:firstDescribed |
1980s
|
| gptkbp:generalizes |
gptkb:Traveling_salesman_problem
|
| gptkbp:goal |
Minimize sum of edge costs and penalties for unvisited nodes
|
| gptkbp:hasApplication |
gptkb:Logistics
Routing Network design |
| gptkbp:prohibits |
Each node can be either visited or not
Penalties are paid for unvisited nodes |
| gptkbp:relatedTo |
gptkb:Traveling_salesman_problem
|
| gptkbp:studiedIn |
gptkb:Theoretical_computer_science
Operations research |
| gptkbp:supportsAlgorithm |
Approximation algorithms
|
| gptkbp:bfsParent |
gptkb:Traveling_salesman_problem
|
| gptkbp:bfsLayer |
7
|
| http://www.w3.org/2000/01/rdf-schema#label |
Prize-collecting TSP
|