Pages that link to "Item:Q4345053"
From MaRDI portal
The following pages link to VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS (Q4345053):
Displaying 7 items.
- Improved algorithms for joint optimization of facility locations and network connections (Q322548) (← 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)
- Better approximation ratios for the single-vehicle scheduling problems on line-shaped networks (Q3150129) (← links)
- Robust identification for multi-section freeway traffic models (Q3428252) (← links)