Approximation algorithms for solving the trip-constrained vehicle routing cover problems
From MaRDI portal
Recommendations
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
- Time-constrained maximal covering routing problem
- Approximation algorithms for some vehicle routing problems
- Distance constrained vehicle routing problem to minimize the total cost
- Approximation results for min-max path cover problems in vehicle routing
Cites work
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
- Approximation Algorithms for Min-Max Cycle Cover Problems
- Approximation results for a min-max location-routing problem
- Approximation results for min-max path cover problems in vehicle routing
- Approximations for minimum and min-max vehicle routing problems
- Combinatorial optimization. Theory and algorithms
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- New approximation algorithms for the rooted budgeted cycle cover problem
- Solution of a min-max vehicle routing problem
- Solving min-max multi-depot vehicle routing problem
- The design of approximation algorithms
This page was built for publication: Approximation algorithms for solving the trip-constrained vehicle routing cover problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646740)