An approximation algorithm for solving the heterogeneous Chinese postman problem

DOI10.1007/978-3-030-93176-6_4zbMath1503.90115OpenAlexW4205952169MaRDI QIDQ2151360

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

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)

Related Items (1)

Approximation algorithms for solving the heterogeneous Chinese postman problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• The vehicle routing problem. Latest advances and new challenges.
• Capacitated Vehicle Routing with Nonuniform Speeds
• Vehicle Routing
• Matching, Euler tours and the Chinese postman
• Maximum matching and a polyhedron with 0,1-vertices
• Combinatorial optimization. Theory and algorithms

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