Algorithms for the Chinese postman problem on mixed networks

DOI10.1016/0305-0548(94)00036-8zbMath0833.90118OpenAlexW1986637787MaRDI QIDQ1894723

Yanyan Li

Publication date: 18 March 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(94)00036-8

zbMATH Keywords

Chinese postmanmixed networks

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (3)

Solvable cases of the \(k\)-person Chinese postman problem ⋮ Algorithms for the rural postman problem ⋮ Approximate solutions for the maximum benefit chinese postman problem

Cites Work

• Approximate solutions for the capacitated arc routing problem
• A method and two algorithms on the theory of partitions
• Routeing winter gritting vehicles
• The Chinese Postman Problem for Mixed Networks
• On the complexity of edge traversing
• Approximation Algorithms for Some Postman Problems
• Matching, Euler tours and the Chinese postman
• Networks and vehicle routing for municipal waste collection
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for the Chinese postman problem on mixed networks