Combining Approximation Algorithms for the Prize-Collecting TSP
Michel X. GoemansPublished in: CoRR (2009)
Keyphrases
- approximation algorithms
- prize collecting
- np hard
- special case
- vertex cover
- worst case
- traveling salesman problem
- minimum cost
- primal dual
- open shop
- set cover
- randomized algorithms
- approximation ratio
- genetic algorithm
- travel time
- undirected graph
- ant colony optimization
- precedence constraints
- network design problem
- approximation schemes
- combinatorial optimization
- disjoint paths
- combinatorial auctions
- branch and bound algorithm
- optimal solution
- knapsack problem
- greedy algorithm
- optimization problems
- search space