Pages that link to "Item:Q3065634"
From MaRDI portal
The following pages link to Approximation results for min-max path cover problems in vehicle routing (Q3065634):
Displaying 12 items.
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- A min-max vehicle routing problem with split delivery and heterogeneous demand (Q376008) (← links)
- Approximation results for a min-max location-routing problem (Q765374) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
- Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems (Q3196380) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5918725) (← links)
- Approximation algorithms for some minimum postmen cover problems (Q5918771) (← links)
- New approximation algorithms for the minimum cycle cover problem (Q5919633) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5925709) (← links)
- A multi‐vehicle covering tour problem with speed optimization (Q6065856) (← links)
- Scheduling on a graph with release times (Q6204662) (← links)
