Algorithms for the Chinese postman problem on mixed networks
- 31 May 1995
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 22 (5) , 479-489
- https://doi.org/10.1016/0305-0548(94)00036-8
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Efficient Routeing for Winter GrittingJournal of the Operational Research Society, 1992
- Approximate solutions for the capacitated arc routing problemComputers & Operations Research, 1989
- The chinese postman problem for mixed graphsPublished by Springer Nature ,1981
- Routing electric meter readersComputers & Operations Research, 1979
- The Chinese Postman Problem for Mixed NetworksManagement Science, 1979
- Approximation Algorithms for Some Postman ProblemsJournal of the ACM, 1979
- On the complexity of edge traversingJournal of the ACM, 1976
- Networks and vehicle routing for municipal waste collectionNetworks, 1974
- The optimum traversal of a graphOmega, 1973
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973