W.L. Pearn, J.B. Chou. Improved solutions for the Chinese postman problem on mixed networks. „Computers & Operations Research”. 26 (8), s. 819–827, lipiec 1999. Elsevier Science Ltd.. DOI: 10.1016/S0305-0548(98)00092-6. ISSN0305-0548. (ang.).
J.Edmonds, E.L.Johnson. Matching Euler tours and the Chinese postman problem. „Mathematical Programming”, s. 88–124, 1973. DOI: 10.1007/bf01580113. (ang.).
dx.doi.org
William R.W.R.StewartWilliam R.W.R., Chinese Postman Problem, Saul I.S.I.Gass, Michael C.M.C.Fu (red.), Boston, MA: Springer US, 2013, s. 161–164, DOI: 10.1007/978-1-4419-1153-7_110, ISBN 978-1-4419-1153-7 [dostęp 2024-01-30](ang.).
worldcat.org
W.L. Pearn, J.B. Chou. Improved solutions for the Chinese postman problem on mixed networks. „Computers & Operations Research”. 26 (8), s. 819–827, lipiec 1999. Elsevier Science Ltd.. DOI: 10.1016/S0305-0548(98)00092-6. ISSN0305-0548. (ang.).