Dispersing Obnoxious Facilities on Graphs by Rounding Distances.
Tim A. HartmannStefan LendlPublished in: CoRR (2022)
Keyphrases
- facility location
- facility location problem
- approximation algorithms
- mixed integer
- demand points
- distance measure
- linear programming
- graph matching
- undirected graph
- graph theoretic
- directed graph
- graph theory
- dissimilarity measure
- lot sizing
- euclidean distance
- special case
- search algorithm
- convex hull
- distance function
- hamming distance
- mixed integer programming
- distance computation
- network design problem
- series parallel
- high dimensional