Approximation algorithms for the min-max mixed rural postmen cover problem and its variants

DOI10.1007/978-3-031-22105-7_4MaRDI QIDQ6168929zbMATH OpenFDO

Authors Liting Huang, Wei Yu, Zhaohui Liu

Publication date 10 August 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmstacker crane problemmixed Chinese postman problemmixed rural postman problempostmen cover problem

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx)

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 Postman Problems
• Approximation algorithms for some min-max and minimum stacker crane cover problems
• Approximation algorithms for some min-max postmen cover 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)

• A 3/2-Approximation Algorithm for the Mixed Postman Problem
• The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm
• On \((1+\varepsilon)\)-approximate data reduction for the Rural Postman problem
• Approximation algorithms for some minimum postmen cover problems

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)