Pages that link to "Item:Q4380541"
From MaRDI portal
The following pages link to Complexity Of The Single Vehicle Scheduling Problem On Graphs (Q4380541):
Displaying 8 items.
- Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle (Q428867) (← links)
- 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. (Q1406038) (← links)
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840) (← links)
- An approximability result of the multi-vehicle scheduling problem on a path with release and handling times (Q1884949) (← links)
- Linear time approximation schemes for vehicle scheduling problems (Q1887080) (← links)
- Improved algorithms for single vehicle scheduling on tree/cycle networks (Q2051909) (← links)
- Vehicle scheduling problems with two agents on a line (Q2099389) (← links)
- Scheduling on a graph with release times (Q6204662) (← links)
