Approximation algorithms for two clustered arc routing problems
From MaRDI portal
Recommendations
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs
- Approximation algorithms for general cluster routing problem
- Approximation algorithms for a mixed postman problem with restrictions on the arcs
- The generalized arc routing problem
- Approximation algorithms for mixed, windy, and capacitated arc routing problems
Cites work
- A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem
- An algorithm for the hierarchical Chinese postman problem
- Approximation Algorithms for Some Postman Problems
- Approximation algorithms with constant ratio for general cluster routing problems
- Arc Routing
- Arc Routing Problems, Part II: The Rural Postman Problem
- Matching, Euler tours and the Chinese postman
- On general routing problems
- On the hierarchical Chinese postman problem with linear ordered classes
- Postman tour on a graph with precedence relation on arcs
- The complexity of arc routing problems
- The generalized arc routing problem
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
Cited in
(3)
This page was built for publication: Approximation algorithms for two clustered arc routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645185)
