Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs.
David S. JohnsonLee BreslauIlias DiakonikolasNick DuffieldYu GuMohammadTaghi HajiaghayiHoward J. KarloffMauricio G. C. ResendeSubhabrata SenPublished in: Oper. Res. (2020)
Keyphrases
- facility location
- set cover
- integer programming
- np hard
- network flow
- greedy algorithm
- approximation algorithms
- greedy heuristics
- network design
- lagrangian relaxation
- solution space
- minimum cost
- convex hull
- mixed integer
- shortest path
- greedy heuristic
- multi criteria
- np complete
- primal dual
- linear programming
- linear program
- special case
- column generation
- optimal solution
- multi objective
- scheduling problem
- network structure