Solvable cases of the \(k\)-person Chinese postman problem
type: Item
instance of: scholarly article
title: Solvable cases of the \(k\)-person Chinese postman problem
zbMATH Open document ID: 0823.90128
DOI: 10.1016/0167-6377(94)90073-6
published in: Operations Research Letters
publication date: 1995-07-06T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 761914
zbMATH Keywords: Chinese postman
zbMATH Keywords: multiple-vehicle extension
author: Wen Lea Pearn
MaRDI profile type: Publication
full work available at URL: 0167-6377(94)90073-6
OpenAlex ID: W2094043080
cites work: The Capacitated Chinese Postman Problem: Lower Bounds and Solvable Cases
cites work: Networks and vehicle routing for municipal waste collection
cites work: The Capacitated Arc Routing Problem: Lower bounds
cites work: Matching, Euler tours and the Chinese postman
cites work: On the windy postman problem
cites work: Q5519709
cites work: A new algorithm for the directed Chinese postman problem
cites work: Q3863425
cites work: The Chinese Postman Problem for Mixed Networks
cites work: On the complexity of edge traversing
cites work: Improved solutions for the Chinese postman problem on mixed networks
cites work: Algorithms for the windy postman problem
cites work: Algorithms for the Chinese postman problem on mixed networks
cites work: On the windy postman problem on Eulerian graphs
description: scientific article; zbMATH DE number 761914