Facility location with dynamic distance functions

DOI10.1023/A:1009796525600zbMath0916.90172OpenAlexW3021449749MaRDI QIDQ1282205

Randeep Bhatia, Yoram J. Sussmann, Samir Khuller, Sudipto Guha

Publication date: 28 March 1999

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009796525600

zbMATH Keywords

facility locationapproximation algorithms\(K\)-center problemdynamic distance functionstime-invariant solutions

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (8)

Asymmetric \(k\)-center with minimum coverage ⋮ Flexible-attribute problems ⋮ A mixed integer linear program and tabu search approach for the complementary edge covering problem ⋮ Facility location with dynamic distance functions ⋮ Asymmetry in \(k\)-center variants ⋮ THE STEINER CENTRE OF A SET OF POINTS: STABILITY, ECCENTRICITY, AND APPLICATIONS TO MOBILE FACILITY LOCATION ⋮ Two-stage flexible-choice problems under uncertainty ⋮ One-way and round-trip center location problems

This page was built for publication: Facility location with dynamic distance functions