A primal-dual approximation algorithm for the k-prize-collecting minimum power cover problem.
Xiaofei LiuWeidong LiRuntao XiePublished in: Optim. Lett. (2022)
Keyphrases
- primal dual
- linear programming
- convergence rate
- np hard
- dynamic programming
- approximation algorithms
- prize collecting
- semidefinite programming
- linear program
- particle swarm optimization
- cost function
- interior point methods
- simplex method
- affine scaling
- objective function
- worst case
- randomly generated
- multi objective
- linear programming problems
- simplex algorithm
- dual formulation