Pages that link to "Item:Q765374"
From MaRDI portal
The following pages link to Approximation results for a min-max location-routing problem (Q765374):
Displaying 16 items.
- A survey of recent research on location-routing problems (Q296678) (← links)
- Improved approximation algorithms for some min-max and minimum cycle cover problems (Q344767) (← links)
- Approximation algorithms for some extensions of the maximum profit routing problem (Q2105889) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity (Q2156303) (← links)
- New LP relaxations for minimum cycle/path/tree cover problems (Q2283007) (← links)
- Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
- A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
- Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
- Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems (Q3196380) (← links)
- Approximations for minimum and min-max vehicle routing problems (Q5491457) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5918725) (← links)
- New approximation algorithms for the minimum cycle cover problem (Q5919633) (← links)
- New approximation algorithms for the rooted budgeted cycle cover problem (Q5925709) (← links)
- Scheduling on a graph with release times (Q6204662) (← links)
- Approximation algorithms for solving the trip-constrained vehicle routing cover problems (Q6646740) (← links)
