Pages that link to "Item:Q428867"
From MaRDI portal
The following pages link to Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle (Q428867):
Displaying 8 items.
- Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
- The multiple traveling salesman problem on spiders (Q831830) (← links)
- Set covering in fuel-considered vehicle routing problems (Q896127) (← links)
- Improved algorithms for single vehicle scheduling on tree/cycle networks (Q2051909) (← links)
- Vehicle scheduling problems with two agents on a line (Q2099389) (← links)
- Two-agent vehicle scheduling problem on a line-shaped network (Q2691417) (← links)
- A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW (Q2942382) (← links)
- Scheduling on a graph with release times (Q6204662) (← links)