A primal-dual approximation algorithm for the Asymmetric Prize-Collecting TSP.
Viet Hung NguyenPublished in: J. Comb. Optim. (2013)
Keyphrases
- primal dual
- linear programming
- cost function
- optimal solution
- computational complexity
- search space
- linear program
- convergence rate
- prize collecting
- approximation algorithms
- dynamic programming
- ant colony optimization
- convex optimization
- np hard
- linear programming problems
- simulated annealing
- worst case
- knapsack problem
- hybrid algorithm
- semidefinite programming
- simplex method
- integrality gap
- learning algorithm
- interior point methods
- affine scaling
- objective function