Minimizing movement in mobile facility location problems
From MaRDI portal
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
Cited in
(17)- The capacitated mobile facility location problem
- Online facility location with mobile facilities
- Facility reallocation on the line
- Approximation algorithms for clustering with dynamic points
- Optimizing movement in convex and non-convex path-networks to establish connectivity
- Reallocating multiple facilities on the line
- Mobile facility location: combinatorial filtering via weighted occupancy
- Exact and approximate algorithms for movement problems on (special classes of) graphs
- Optimizing movement in convex and non-convex path-networks to establish connectivity
- O(1)-approximations for maximum movement problems
- Local search heuristics for the mobile facility location problem
- Exact and approximate algorithms for movement problems on (special classes of) graphs
- Network movement games
- Constrained \(k\)-center and movement to independence
- Local-search based approximation algorithms for mobile facility location problems (extended abstract)
- Approximation algorithms for clustering with dynamic points
- Algorithms for minimizing the movements of spreading points in linear domains
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)
