Pages that link to "Item:Q831830"
From MaRDI portal
The following pages link to The multiple traveling salesman problem on spiders (Q831830):
Displaying 3 items.
- Solving the multiple traveling salesperson problem on regular grids in linear time (Q2050264) (← links)
- Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints (Q2169436) (← links)
- Exact and approximation algorithms for the multi-depot data mule scheduling with handling time and time span constraints (Q6606172) (← links)