Approximation algorithms for some extensions of the maximum profit routing problem
From MaRDI portal
Publication:2105889
Recommendations
- Optimal solutions for routing problems with profits
- Approximation algorithms for some vehicle routing problems
- An approximation algorithm for the general routing problem
- Approximation results for a min-max location-routing problem
- Improved approximation algorithms for min-max and minimum vehicle routing problems
- Approximation algorithms for a vehicle routing problem
- Approximations for minimum and min-max vehicle routing problems
- Complexity and approximation for traveling salesman problems with profits
- The undirected capacitated general routing problem with profits
Cites work
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows
- Capacitated arc routing problems
- Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
- Constant-factor approximations for capacitated arc routing without triangle inequality
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- New inapproximability bounds for TSP
- P-Complete Approximation Problems
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- The Traveling Salesman Problem with Distances One and Two
- Vehicle Routing with Time Windows: Two Optimization Algorithms
This page was built for publication: Approximation algorithms for some extensions of the maximum profit routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105889)
