Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
From MaRDI portal
(Redirected from Publication:6168929)
Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (scientific article; zbMATH DE number 7724731)
Approximation algorithms for the min-max mixed rural postmen cover problem and its variants (scientific article; zbMATH DE number 7724731)
Cites work
- A 3/2-Approximation Algorithm for the Mixed Postman Problem
- A fundamental problem in vehicle routing
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
- Approximation algorithms for some min-max and minimum stacker crane cover problems
- Approximation algorithms for some min-max postmen cover problems
- Approximation Algorithms for Some Postman Problems
- Approximations for minimum and min-max vehicle routing problems
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Matching, Euler tours and the Chinese postman
- Min-Max K-vehicles windy rural postman problem
- On general routing problems
- On the complexity of edge traversing
- Security routing games with multivehicle Chinese postman problem
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
- Synchronized arc routing for snow plowing operations
Cited in
(4)
This page was built for publication: Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168929)