Approximation algorithms for some extensions of the maximum profit routing problem.
Bogdan ArmaseluPublished in: J. Comb. Optim. (2023)
Keyphrases
- approximation algorithms
- routing problem
- maximum profit
- knapsack problem
- np hard
- vehicle routing problem
- special case
- vertex cover
- minimum cost
- worst case
- shortest path
- routing algorithm
- exact algorithms
- travel time
- approximation ratio
- facility location problem
- randomized algorithms
- global optimization
- primal dual
- polynomial time approximation
- multicommodity flow
- constant factor
- optimal solution
- neural network
- optimization problems