A new algorithm for the directed Chinese postman problem

DOI10.1016/0305-0548(88)90053-6zbMath0664.90090OpenAlexW1799058206MaRDI QIDQ1115814

Yaxiong Lin, Yongchang Zhao

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0305-0548(88)90053-6

zbMATH Keywords

computational complexitytransportation problemminimum cost flow problemComplementary Slackness Theoremdirected Chinese Postman Problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)

Related Items (5)

Time-constrained Chinese postman problems ⋮ Solvable cases of the \(k\)-person Chinese postman problem ⋮ Routing problems: A bibliography ⋮ Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics ⋮ Uncertain multi-objective Chinese postman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Chinese Postman Problem for Mixed Networks
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Matching, Euler tours and the Chinese postman
• Networks and vehicle routing for municipal waste collection

This page was built for publication: A new algorithm for the directed Chinese postman problem