Profit-earning facility location

DOI10.1145/380752.380756zbMath1323.90034OpenAlexW2041505361MaRDI QIDQ5175950

Adam Meyerson

Publication date: 27 February 2015

Published in: Proceedings of the thirty-third annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/380752.380756

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items

A distribution network design problem in the automotive industry: MIP formulation and heuristics ⋮ A profit-maximizing supply chain network design model with demand choice flexibility ⋮ Incremental facility location problem and its competitive algorithms ⋮ Online clustering with variable sized clusters ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Accurate Low-Space Approximation of Metric k-Median for Insertion-Only Streams ⋮ Improved Online Algorithms for Knapsack and GAP in the Random Order Model ⋮ On the competitive ratio for online facility location ⋮ Online facility location with facility movements ⋮ Small space representations for metric min-sum \(k\)-clustering and their applications ⋮ An improved algorithm for online unit clustering ⋮ An efficient optimization procedure for designing a capacitated distribution network with price-sensitive demand

Cites Work

• A constant-factor approximation algorithm for the k -median problem (extended abstract)