Minimizing movement in mobile facility location problems

DOI10.1145/1978782.1978783zbMATH Open1295.90019OpenAlexW2125938788MaRDI QIDQ3189010FDOQ3189010

Authors: Zachary Friggstad, Mohammad 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

Recommendations

• Local-search based approximation algorithms for mobile facility location problems (extended abstract)
• Mobile facility location: combinatorial filtering via weighted occupancy
• The capacitated mobile facility location problem
• Local search heuristics for the mobile facility location problem
• Online facility location with facility movements

zbMATH Keywords

linear programmingapproximation algorithmsfacility location

Mathematics Subject Classification ID

Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Continuous location (90B85)

Cited In (17)

• Reallocating multiple facilities on the line
• Constrained \(k\)-center and movement to independence
• Serving Online Requests with Mobile Servers
• The capacitated mobile facility location problem
• Optimizing movement in convex and non-convex path-networks to establish connectivity
• Approximation algorithms for clustering with dynamic points
• Approximation algorithms for clustering with dynamic points
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• Local search heuristics for the mobile facility location problem
• Exact and approximate algorithms for movement problems on (special classes of) graphs
• \(O(1)\)-approximations for maximum movement problems
• Online facility location with mobile facilities
• Network movement games
• Mobile facility location: combinatorial filtering via weighted occupancy
• Facility reallocation on the line
• Local-search based approximation algorithms for mobile facility location problems (extended abstract)
• Optimizing movement in convex and non-convex path-networks to establish connectivity

This page was built for publication: Minimizing movement in mobile facility location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189010)