Pages that link to "Item:Q1884949"
From MaRDI portal
The following pages link to An approximability result of the multi-vehicle scheduling problem on a path with release and handling times (Q1884949):
Displaying 10 items.
- Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
- Routing open shop and flow shop scheduling problems (Q421573) (← links)
- Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle (Q428867) (← links)
- The multiple traveling salesman problem on spiders (Q831830) (← links)
- Set covering in fuel-considered vehicle routing problems (Q896127) (← links)
- Heuristic approaches for solving transit vehicle scheduling problem with route and fueling time constraints (Q2383860) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW (Q2942382) (← links)
- Single-vehicle scheduling problems with release and service times on a line (Q3082601) (← links)
- Scheduling on a graph with release times (Q6204662) (← links)
