Approximation algorithms for solving the heterogeneous Chinese postman problem

DOI10.1007/S10878-022-00931-5OpenAlexW4310080440MaRDI QIDQ2106868FDOQ2106868

Authors: Jianping Li, Pengxiang Pan, Junran Lichen, Lijian Cai, Wencheng Wang, 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

Recommendations

• An approximation algorithm for solving the heterogeneous Chinese postman problem
• scientific article; zbMATH DE number 1947382
• Capacitated vehicle routing with nonuniform speeds
• scientific article; zbMATH DE number 1187150
• Approximation algorithms for some min-max postmen cover problems

zbMATH Keywords

combinatorial optimizationapproximation algorithmsheterogeneous Chinese postman toursnonuniform speeds

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• An approximation algorithm for solving the heterogeneous Chinese postman problem
• An improved heuristic algorithm for the maximum benefit Chinese postman problem
• The \(k\)-centrum Chinese postman delivery problem and a related cost allocation game
• 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
• Approximating the length of Chinese postman tours

Uses Software

• VRP

This page was built for publication: Approximation algorithms 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 Q2106868)