Approximation algorithms for the min-max mixed rural postmen cover problem and its variants
From MaRDI portal
Publication:6168929
DOI10.1007/978-3-031-22105-7_4MaRDI QIDQ6168929FDOQ6168929
Authors: Liting Huang, Wei Yu, Zhaohui Liu 
Publication date: 10 August 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
approximation algorithmstacker crane problemmixed Chinese postman problemmixed rural postman problempostmen cover problem
Cites Work
- A fundamental problem in vehicle routing
- Matching, Euler tours and the Chinese postman
- On the complexity of edge traversing
- On general routing problems
- Approximation Algorithms for Some Postman Problems
- A 3/2-Approximation Algorithm for the Mixed Postman Problem
- Arc Routing Problems, Part I: The Chinese Postman Problem
- Synchronized arc routing for snow plowing operations
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
- Approximations for minimum and min-max vehicle routing problems
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
- Min-Max \(K\)-vehicles windy rural postman problem
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
- Security routing games with multivehicle Chinese postman problem
- Approximation algorithms for some min-max and minimum stacker crane cover problems
- Approximation algorithms for some min-max postmen cover problems
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)
