Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints
From MaRDI portal
Publication:6606172
DOI10.1007/978-3-031-49611-0_9MaRDI QIDQ6606172
Wei Yu, Zhaohui Liu, Minqin Liu, Xinmeng Guo
Publication date: 16 September 2024
Cites Work
- Title not available (Why is that?)
- The multiple traveling salesman problem on spiders
- Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints
- Data mule scheduling on a path with handling time and time span constraints
- Approximation algorithms for distance constraint sweep coverage with base stations
- Approximation algorithms for distance constrained vehicle routing problems
- On the Distance Constrained Vehicle Routing Problem
- Approximation algorithm for distance constraint sweep coverage without predetermined base stations
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
- New approximation algorithms for the rooted budgeted cycle cover problem
This page was built for publication: Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606172)
