Approximation algorithms for solving the heterogeneous Chinese postman problem

DOI10.1007/s10878-022-00931-5OpenAlexW4310080440MaRDI QIDQ2106868

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

Publication date: 29 November 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00931-5

zbMATH Keywords

combinatorial optimizationapproximation algorithmsheterogeneous Chinese postman toursnonuniform speeds

Mathematics Subject Classification ID

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

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem
• 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
• The vehicle routing problem. Latest advances and new challenges.
• Worst-case analysis of a new heuristic for the travelling salesman problem
• An approximation algorithm for solving the heterogeneous Chinese postman problem
• Capacitated Vehicle Routing with Nonuniform Speeds
• Vehicle Routing
• Matching, Euler tours and the Chinese postman
• Min-Max Tours and Paths for Task Allocation to Heterogeneous Agents
• Combinatorial optimization. Theory and algorithms.
• A (slightly) improved approximation algorithm for metric TSP

This page was built for publication: Approximation algorithms for solving the heterogeneous Chinese postman problem