C
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Approximation algorithms for k-level stochastic facility location problems.
Lucas P. Melo
Flávio Keidi Miyazawa
Lehilton L. C. Pedrosa
Rafael Crivellari Saliba Schouery
Published in:
J. Comb. Optim. (2017)
Keyphrases
</>
approximation algorithms
facility location problem
np hard
approximation schemes
special case
minimum cost
vertex cover
worst case
set cover
open shop
approximation ratio
primal dual
randomized algorithms
network design problem
polynomial time approximation
branch and bound algorithm
disjoint paths