Finding postal carrier walk paths in mixed graphs

Computational Optimization and Applications

Volumn 9, Issue 3, 1998, Pages 229-247

  Yan, Hong ^a   Thompson, Gerald L ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Edge traversais in graphs; Postman problem; Windy postman problem

Indexed keywords

CHINESE POSTMAN PROBLEM; EDGE TRAVERSALS IN GRAPHS; POSTMAN PROBLEM; WINDY POSTMAN PROBLEM;

ALGORITHMS; COMPUTATIONAL METHODS; GRAPHIC METHODS; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; COMPUTER SOFTWARE; COST ACCOUNTING; GRAPH THEORY; OPTIMIZATION;

PROBLEM SOLVING; POSTAL SERVICES;

POSTMAN PROBLEM;

EID: 0032023327     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1018350224084     Document Type: Article

References (22)

1. A.A. Assad and B.L. Golden, "Arc routing methods and applications," in Network Routing, Handbooks in Operations Research and Management Science, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Eds.), Elsevier: Amsterdam, New York, 1995, pp. 375-483.
2. P. Brucker, "The Chinese postman problem for mixed graphs," in Graph Theoretic Concepts in Computer Science, H. Noltemeier (Ed.), Springer: Berlin, 1981, pp. 354-366.
3. N. Christofides, Graph Theory-An Algorithmic Approach, Academic Press: New York, 1975.
4. J. Edmonds and E. Johnson, "Matching, Euler tours and the Chinese postman problem," Mathematical Programming, vol. 5, pp. 88-124, 1973.
5. H.A. Eiselt, M. Gendreau, and G. Laporte, "Arc routing problems, Part I: The Chinese routing problem," Operations Research, vol. 43, pp. 231-242, 1995.
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," Journal of Association for Computing Machinery, vol. 26, pp. 538-554, 1979.
8. M. Gendreau, G. Laporte, and Y. Zhao, "The windy postman problem on general graphs," Working paper, Centre de recherche sur les transports, Universite de Montreal, 1990.
9. M. Grotschel and Z. Win, "On the windy postman polyhedron," Report No. 75, Schwerpunktprogram des deutschen Forschungsgemeinschaft, Universitat Augsburg, 1988.
10. M. Grotschel and Z. Win, "A cutting plane algorithm for the windy postman problem," Mathematical Programming, vol. 55, pp. 339-358, 1992.
11. M. Guan, "Graphic programming using odd and even points," Chinese Mathematics, vol. 1, pp. 237-277, 1962.
12. M. Guan, "On the windy postman problem," Discrete Applied Mathematics, vol. 9, pp. 41-44, 1984.
13. M. Guan, and W. Pulleyblank, "Eulerian orientations and circulations," SIAM Journal on Algebra and Discrete Mathematics, vol. 6, pp. 657-664, 1985.
14. F. Harche and G.L. Thompson, "The column subtraction method: An exact algorithm for solving weighted set partitioning, covering and packing problems," Computers and Operations Research, vol. 21, pp. 423-435, 1994.
15. D.B. Johnson, "Finding all the elementary circuits of a directed graph," SIAM Journal on Computing, vol. 4, pp. 77-84, 1975.
16. E. Minieka, Optimization Algorithms for Networks and Graphs, Marcel Dekker: New York, 1978.
17. E. Minieka, "The Chinese postman problem for mixed networks," Management Science, vol. 25, pp. 643-646, 1979.
18. C.S. Orloff, "A fundamental problem in vehicle routing," Networks, vol. 5, pp. 357-370, 1974.
19. C. Papadimitriou, "On the complexity of edge traversing," Journal of the Association of Computing Machinery, vol. 23, pp. 544-554, 1976.
20. A.P. Sethi and G.L. Thompson, "The pivot and probe algorithm for solving a linear program," Mathematical Programming, vol. 29, pp. 219-233, 1984.
21. Z. Win, "Contributions to Routing Problems," Doctoral Dissertation, Universitat Augsburg, 1987.
22. Z. Win, "On the windy postman problem on Eulerian graphs," Mathematical Programming, vol. 44, pp. 97-112, 1989.