An optimal algorithm for the mixed Chinese postman problem

Networks

Volumn 27, Issue 2, 1996, Pages 95-108

  Nobert, Yves ^a,b   Picard, Jean Claude ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITÉ DU QUÉBEC À MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039611814     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1097-0037(199603)27:2<97::aid-net1>3.0.co;2-8     Document Type: Article

References (21)

1. F. Barahona, On some applications of the Chinese post-man problem. Path Flows and VLSI Layouts. Springer-Verlag, Heidelberg, Germany (1990).
2. M. Bellmore and S. Hong, Transformation of multisalesman problem to the standard traveling salesman problem. J. ACM 21 (1974) 500-504.
3. L. D. Bodin and S. J. Kursh, A computer-assisted system for the routing and scheduling of street sweepers. Oper. Res. 26 (1978) 525-537.
4. N. Christofides, E. Benavent, V. Campos, A. Corberan, and E. Mota, An optimal algorithm for the mixed Chinese postman problem. System Modelling and Optimization (P. Thoft-Christensen, Ed.). Lecture Notes in Control and Information Sciences No. 59 (Springer, Berlin, 1984), 641-649.
5. J. Edmonds and E. L. Johnson, Matching, Euler tours and the Chinese postman. Math. Program. 5 (1973) 88-124.
6. L. R. Ford and D. R. Fulkerson, Flows in Networks (Princeton University Press, Princeton, NJ, 1962).
7. G. N. Frederickson, Approximation algorithms for some postman problems. J. ACM 26 (1979) 538-544.
8. G. N. Frederickson, M. S. Hecht, and C. E. Kim, Approximation algorithm for some routing problems. SIAM J. Comput. 7 (1978) 178-193.
9. M. Grötschel and Z. Win, A cutting plane algorithm for the windy postman problem. Math. Program. 55 (1992) 339-358.
10. R. Jorker and T. Volgenant, Transforming asymmetric into symmetric traveling salesman problem. Oper. Res. Lett. 2 (1983) 161-163.
11. C. H. Kapauf and G. J. Koehler, The mixed postman problem. Discr. Appl. Math. 1 (1979) 89-103.
12. A. H. Land and S. Powell, Fortran Codes for Mathematical Programming: Linear, Quadratic and Discrete. Wiley, New York (1973).
13. E. Minieka, The Chinese postman problem for mixed networks. Manag. Sci. 25 (1979) 643-648.
14. G. L. Nemhauser and L. A. Wolsey, Integer and Combinatorial Optimization. Wiley, New York (1988).
15. Y. Nobert, Construction d'algorithmes optimaux pour des extensions au problème du voyageur de commerce. PhD Thesis, Université de Montréal (1983).
16. M. W. Padberg and M. R. Rao, Odd Minimum Cut-Sets and b-Matchings. Math. Oper. Res. 7 (1982) 67-80.
17. C. H. Papadimitriou, On the complexity of edge traversing. J. Assoc. Comput. Machin. 23 (1976) 544-554.
18. W. L. Pearn, A. Assad, and B. Golden, Transforming arc routing into node routing problems. Comput. Oper. Res. 4 (1987) 285-288.
19. J. C. Picard and M. Queyranne, On the structure of all minimum cuts in a network and applications. Math. Program 13 (1980) 8-16.
20. J. C. Picard and H. D. Ratliff, Minimum cuts and related problems. Networks 5 (1975) 357-370.
21. A. Schrijver, Theory of Linear and Integer Programming. Wiley, New York (1986).