New approximation algorithms for the heterogeneous weighted delivery problem
From MaRDI portal
Recommendations
Cites work
- O(1)-approximations for maximum movement problems
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
- A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- An efficient algorithm for the fast delivery problem
- Capacitated vehicle routing with non-uniform speeds
- Collective fast delivery by energy-efficient agents
- Data delivery by energy-constrained mobile agents
- Data delivery by energy-constrained mobile agents on a line
- Energy-efficient fast delivery by mobile agents
- Exact and approximate algorithms for movement problems on (special classes of) graphs
- scientific article; zbMATH DE number 1775395 (Why is no real title available?)
- scientific article; zbMATH DE number 6862102 (Why is no real title available?)
- Minimizing movement
- Polygon-constrained motion planning problems
Cited in
(3)
This page was built for publication: New approximation algorithms for the heterogeneous weighted delivery problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5918793)
