The heterogeneous rural postman problem
From MaRDI portal
Cites work
- 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
- A (slightly) improved approximation algorithm for metric TSP
- A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem
- Approximation Algorithms for Min-Max Cycle Cover Problems
- Approximation algorithms for solving the heterogeneous Chinese postman problem
- Arc Routing Problems, Part II: The Rural Postman Problem
- Capacitated vehicle routing with nonuniform speeds
- Combinatorial optimization. Theory and algorithms
- Matching, Euler tours and the Chinese postman
- Min-Max Tours and Paths for Task Allocation to Heterogeneous Agents
- Min-max tree covers of graphs.
- Optimal coverage in wireless sensor networks
- The vehicle routing problem. Latest advances and new challenges.
- Vehicle Routing
This page was built for publication: The heterogeneous rural postman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7442681)