Sales‐delivery man problems on treelike networks
From MaRDI portal
Publication:4698228
Recommendations
Cites work
Cited in
(10)- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
- Approximation algorithms for distance constrained vehicle routing problems
- A note on the traveling repairman problem
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times.
- The delivery man problem on a tree network
- Minmax subtree cover problem on cacti
- Network design for time‐constrained delivery
- Search and delivery man problems: when are depth-first paths optimal?
- Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks
- A faster 2-approximation algorithm for the minmax p-traveling salesmen problem on a tree
This page was built for publication: Sales‐delivery man problems on treelike networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698228)