Algorithms for the Chinese postman problem on mixed networks
type: Item
instance of: scholarly article
title: Algorithms for the Chinese postman problem on mixed networks
zbMATH Open document ID: 0833.90118
DOI: 10.1016/0305-0548(94)00036-8
author: Yanyan Li
published in: Computers \& Operations Research
publication date: 1996-03-18T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 778499
zbMATH Keywords: Chinese postman
zbMATH Keywords: mixed networks
MaRDI profile type: Publication
full work available at URL: 0305-0548(94)00036-8
OpenAlex ID: W1986637787
cites work: Matching, Euler tours and the Chinese postman
cites work: On the complexity of edge traversing
cites work: Q3337973
cites work: The Chinese Postman Problem for Mixed Networks
cites work: Approximation Algorithms for Some Postman Problems
cites work: Q3912618
cites work: Q4039765
cites work: Networks and vehicle routing for municipal waste collection
cites work: Routeing winter gritting vehicles
cites work: A method and two algorithms on the theory of partitions
cites work: Approximate solutions for the capacitated arc routing problem
description: scientific article; zbMATH DE number 778499