Minimizing movement in mobile facility location problems
From MaRDI portal
Publication:3189010
DOI10.1145/1978782.1978783zbMath1295.90019OpenAlexW2125938788MaRDI QIDQ3189010
Zachary Friggstad, Mohammad R. Salavatipour
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1978782.1978783
Analysis of algorithms and problem complexity (68Q25) Continuous location (90B85) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)
Related Items
Serving Online Requests with Mobile Servers ⋮ Local search heuristics for the mobile facility location problem ⋮ Exact and approximate algorithms for movement problems on (special classes of) graphs ⋮ Approximation algorithms for clustering with dynamic points ⋮ Unnamed Item ⋮ Optimizing movement in convex and non-convex path-networks to establish connectivity ⋮ Optimizing Movement in Convex and Non-convex Path-Networks to Establish Connectivity ⋮ Reallocating multiple facilities on the line ⋮ The capacitated mobile facility location problem ⋮ Network movement games ⋮ Mobile facility location: combinatorial filtering via weighted occupancy ⋮ Constrained \(k\)-center and movement to independence ⋮ O(1)-Approximations for Maximum Movement Problems ⋮ Online facility location with mobile facilities ⋮ Facility reallocation on the line ⋮ Exact and Approximate Algorithms for Movement Problems on (Special Classes of) Graphs
