Pages that link to "Item:Q5491457"
From MaRDI portal
The following pages link to Approximations for minimum and min-max vehicle routing problems (Q5491457):
Displaying 9 items.
- Approximation algorithms for some min-max and minimum stacker crane cover problems (Q5918727) (← 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 matheuristic for the MinMax capacitated open vehicle routing problem (Q6066715) (← links)
- (Q6084420) (← links)
- Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (Q6130323) (← links)
- A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints (Q6556160) (← links)
- Approximation algorithms for solving the trip-constrained vehicle routing cover problems (Q6646740) (← links)