The ordered k-median problem: surrogate models and approximation algorithms.
Ali AouadDanny SegevPublished in: Math. Program. (2019)
Keyphrases
- approximation algorithms
- constant factor approximation
- np hard
- special case
- vertex cover
- minimum cost
- worst case
- primal dual
- network design problem
- exact algorithms
- np hardness
- set cover
- approximation ratio
- undirected graph
- constant factor
- randomized algorithms
- partially ordered
- precedence constraints
- facility location problem
- greedy heuristic
- open shop
- dynamic programming