Pages that link to "Item:Q1406038"
From MaRDI portal
The following pages link to 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times. (Q1406038):
Displaying 15 items.
- 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)
- Approximation results for a min-max location-routing problem (Q765374) (← links)
- Vehicle routing problems on a line-shaped network with release time constraints (Q1015302) (← 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)
- Data mule scheduling on a path with handling time and time span constraints (Q2228361) (← links)
- New LP relaxations for minimum cycle/path/tree cover problems (Q2283007) (← links)
- Approximating the minmax rooted-tree cover in a tree (Q2380018) (← links)
- Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
- Minmax subtree cover problem on cacti (Q2495907) (← links)
- Dynamic Traveling Repair Problem with an Arbitrary Time Window (Q2971153) (← links)
- Single-vehicle scheduling problems with release and service times on a line (Q3082601) (← links)
- Scheduling on a graph with release times (Q6204662) (← links)
