An approximation algorithm for solving the heterogeneous Chinese postman problem

DOI10.1007/978-3-030-93176-6_4MaRDI QIDQ2151360zbMATH OpenOpenAlexFDO

Authors Jianping Li, Lijian Cai, Junran Lichen, Pengxiang Pan, Wencheng Wang, Suding Liu

Publication date 1 July 2022

Full work available at URL https://doi.org/10.1007/978-3-030-93176-6_4

zbMATH Keywords

combinatorial optimizationapproximation algorithmChinese postman toursnonuniform speeds

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• Approximation algorithms for solving the heterogeneous Chinese postman problem
• An optimal algorithm for the mixed Chinese postman problem
• A heuristic algorithm for the mixed Chinese postman problem
• An algorithm for the hierarchical Chinese postman problem
• Algorithms for the Chinese postman problem on mixed networks
• A new algorithm for the directed Chinese postman problem
• scientific article; zbMATH DE number 124052
• Approximate solutions for the maximum benefit chinese postman problem
• scientific article; zbMATH DE number 4211828
• Publication:4944300

Cites work

• scientific article; zbMATH DE number 1839431 (Why is no real title available?)
• Capacitated vehicle routing with nonuniform speeds
• Combinatorial optimization. Theory and algorithms
• Matching, Euler tours and the Chinese postman
• Maximum matching and a polyhedron with 0,1-vertices
• The vehicle routing problem. Latest advances and new challenges.
• Vehicle Routing

Cited in

(14)

• scientific article; zbMATH DE number 3880464 (Why is no real title available?)
• Approximation algorithms for solving the heterogeneous Chinese postman problem
• The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game
• scientific article; zbMATH DE number 124052 (Why is no real title available?)
• An improved heuristic algorithm for the maximum benefit Chinese postman problem
• scientific article; zbMATH DE number 6500999 (Why is no real title available?)
• A 3/2-Approximation Algorithm for the Mixed Postman Problem
• Parameterized Complexity of the k-Arc Chinese Postman Problem
• Approximate solutions for the maximum benefit chinese postman problem
• Parameterized complexity of the k-arc Chinese postman problem
• Capacitated vehicle routing with non-uniform speeds
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
• Approximating the length of Chinese postman tours
• The Chinese deliveryman problem

Describes a project that uses

Uses Software

• VRP

This page was built for publication: An approximation algorithm for solving the heterogeneous Chinese postman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2151360)