Approximation algorithms for solving the heterogeneous Chinese postman problem
type: Item
instance of: scholarly article
title: Approximation algorithms for solving the heterogeneous Chinese postman problem
author: Jianping Li
author: Pengxiang Pan
author: Junran Lichen
author: Lijian Cai
author: Wencheng Wang
author: Suding Liu
published in: Journal of Combinatorial Optimization
publication date: 2022-11-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7625353
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: nonuniform speeds
zbMATH Keywords: heterogeneous Chinese postman tours
zbMATH Keywords: approximation algorithms
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: s10878-022-00931-5
OpenAlex ID: W4310080440
cites work: A primal-dual approximation algorithm for a two depot heterogeneous traveling salesman problem
cites work: Worst-case analysis of a new heuristic for the travelling salesman problem
cites work: Matching, Euler tours and the Chinese postman
cites work: The vehicle routing problem. Latest advances and new challenges.
cites work: Capacitated vehicle routing with nonuniform speeds
cites work: Q5519709
cites work: A (slightly) improved approximation algorithm for metric TSP
cites work: Combinatorial optimization. Theory and algorithms.
cites work: An approximation algorithm for solving the heterogeneous Chinese postman problem
cites work: Min-Max Tours and Paths for Task Allocation to Heterogeneous Agents
cites work: Vehicle Routing
cites work: Q4782696
cites work: 3-approximation algorithm for a two depot, heterogeneous traveling salesman problem
DOI: 10.1007/S10878-022-00931-5
description: scientific article; zbMATH DE number 7625353