scientific article; zbMATH DE number 1187150
From MaRDI portal
Publication:3840356
Recommendations
Cited in
(17)- A GRASP heuristic for the mixed Chinese postman problem
- Approximation algorithms for solving the heterogeneous Chinese postman problem
- On \((1+\varepsilon)\)-approximate data reduction for the Rural Postman problem
- Postman problems on series-parallel mixed graphs
- New heuristic algorithms for the windy rural postman problem
- Approximation algorithms for a mixed postman problem with restrictions on the arcs
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs
- scientific article; zbMATH DE number 4018800 (Why is no real title available?)
- Feasibility of the Mixed Postman Problem with Restrictions on the Edges
- scientific article; zbMATH DE number 1305467 (Why is no real title available?)
- A 3/2-Approximation Algorithm for the Mixed Postman Problem
- Approximation algorithm for min-max cycle cover problem on a mixed graph
- Approximation algorithms for mixed, windy, and capacitated arc routing problems
- Variants of the mixed postman problem solvable using linear programming
- Approximation algorithms for some minimum postmen cover problems
- Approximation algorithms for solving the vertex-traversing-constrained mixed Chinese postman problem
- A metaheuristic for the min-max windy rural postman problem with K vehicles
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840356)
