Minimizing movement
From MaRDI portal
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Recommendations
Cited in
(35)- The capacitated mobile facility location problem
- Median and covering location problems with interconnected facilities
- ``Green barrier coverage with mobile sensors
- Approximation algorithms for clustering with dynamic points
- Optimizing movement in convex and non-convex path-networks to establish connectivity
- An \(O(1)\)-approximation algorithm for the 2-dimensional geometric freeze-tag problem
- Continuous maximal covering location problems with interconnected facilities
- Exact and approximate algorithms for movement problems on (special classes of) graphs
- Minimizing movement
- ``Green barrier coverage with mobile sensors
- Optimizing movement in convex and non-convex path-networks to establish connectivity
- Euclidean movement minimization
- 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
- Minimizing Movement: Fixed-Parameter Tractability
- Minimizing movement: fixed-parameter tractability
- Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
- Network movement games
- Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
- Constrained \(k\)-center and movement to independence
- Approximation algorithms for clustering with dynamic points
- Collaborative delivery on a fixed path with homogeneous energy-constrained agents
- New approximation algorithms for the heterogeneous weighted delivery problem
- New approximation algorithms for the heterogeneous weighted delivery problem
- Near-gathering of energy-constrained mobile agents
- Advanced network connectivity features and zonal requirements in covering location problems
- A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation
- New formulations for two location problems with interconnected facilities
- On the impact of resource relocation in facing health emergencies
- Algorithms for minimizing the movements of spreading points in linear domains
- Dispersion in disks
- Randomized strategyproof mechanisms for multi-stage facility location problem with capacity constraints
- Integrated mobile facility production and distribution scheduling planning; a synchronized solution framework
- A multi-objective optimization model for a multi-period mobile facility location problem with environmental and disruption considerations
This page was built for publication: Minimizing movement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2930255)
