Abstract
Euler tours occupy an interesting position in the history of graph theory. Current interest in this area is due to problems involving tours where service is required along arcs of the tour rather than at nodes. Examples of problems of this type involve mail delivery, snow removal, street cleaning, trash pickup, etc. In considering such problems involving city streets, the nodes are intersections and the arcs are roadways between intersections. However, there are one-way streets and two-way streets. If the service must be done on both sides of a two-way street then two one-way streets (one in each direction) can replace it. However, there are situations where the street, even though two-way, need only be traversed once. For example, mail delivery in a more rural or suburban setting may require traversing the street or road only once. In a rural road, mail delivery is frequently done on one side of the road, and those who live on the other side must cross the road to get their mail. In setting up the routes, though, the road could be traversed in either direction. Thus, we consider graphs with two types of connections: directed and undirected. Other postman problems [14] have been considered.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barnhart, C., N. Boland, L. Clarke, E.L. Johnson, G.L. Nemhauser, R. Shenoi, “Flight String Models for Aircraft Fleeting and Routing” Transportation Science Vol. 32, No. 3, pp. 208–220, August 1998.
Clarke, L., E.L. Johnson, G.L. Nemhauser, J. Zhu, “The Aircraft Rotation Problem”, Annals of Operations Research 69, pp. 33–46, 1996.
M. Conforti, G. Cornujols, A. Kapoor and K. Vuskovic, “Perfect, Ideal and Balanced Matrices”, (1996).
Cornuéjols, G. “Combinatorial Optimization: Packing and Covering”, Lecture Notes, Carrnegie Mellon University, May 1999.
Cornuéjols, G. and B. Guenin, “On Ideal Binary Clutters and a Conjecture of Seymour”, in preparation.
Edmonds, J. “The Chinese Postman Problem”, Operations Research 13, Suppl. 1, pp. 373, 1965.
Edmonds, J. and E.L. Johnson, “Matching: A Well-Solved Class of Integer Linear Programs”, Combinatorial Structures and Their Applications, proceedings from Calgary, Alberta, Canada, June 1969, pp. 89–92.
Edmonds, J. and R.M. Karp, “Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems”, Combinatorial Structures and Their Applications, proceedings from Calgary, Alberta, Canada, June 1969, pp. 93–96.
Eiselt, H.A. and G. Laporte, “A Historical Perspective on Arc Routing”, this volume.
Ford, L.R. and D.R. Fulkerson, Flows in Networks, Princeton University Press, Princeton, N.J., 1962.
Fulkerson, D.R. “Blocking Polyhedra,” in B. Harris, ed., Graph Theory and its Applications (Academic Press, NY), pp. 93–112, 1970.
Gomory, R.E. “Some Polyhedra Related to Combinatorial Problems,” Linear Algebra and it Applications 2, pp. 451–558, 1969.
Grötschel, M. and W.R. Pulleyblank, “Weakly Bipartite Graphs”, Operations Research Letters 1 pp. 23–27, 1981.
Grötschel, M. and Z. Win, “A Cutting Plane Algorithm for the windy Postman Problem”, Mathematical Programming 55 (1992), pp. 339–358.
Guan, M. “Graphic Programming Using Odd or Even Points”, Chinese Mathematics 1 (1962), pp. 273–377.
Hane, C., C. Barnhart, E.L. Johnson, R. Marsten, G.L. Nemhauser, G. Sigismondi, “The Fleet Assignment Problem: Solving a Large Integer Program”, Mathematical Programming 70, pp. 211–232, 1995.
Johnson, E.L. “On Binary Group Problems having the Fulkerson Property”, Combinatorial Optimization B. Simeone (ed.), Springer-Verlag, Berlin and Heidelberg, pp. 57–112, 1989.
Johnson, E.L. and J. Edmonds, “Matchings, Euler Tours and the Chinese Postman”, Mathematical Programming, Vol. 5, pp. 88–124, 1973.
Johnson, E.L. and G. Gastou, “Binary Group and Chinese Postman Polyhedra”, Mathematical Programming, Vol. 5, pp. 88–124, 1973.
Johnson, E.L. and S. Mosterts, “On Four Problems in Graph Theory,” SIAM Journal on Algebraic and Discrete Methods, Vol. 2, pp. 163–185, 1987.
Khachian, L.G. “A Polynomial Algorithm in Linear Programming”, Soviet Mathematics Doklady 20 pp. 191–194, 1979.
Lehman, A. “On the Width-Length Inequality”, Mathematical Programming 17(1979), pp. 403–417.
Nobert, Y. and J.-C. Picard, “An Optimal Algorithm for the Mixed Chinese Postman Problem”, Networks Vol. 27 (1996), pp. 95–108.
Padberg, M. and M. Rao, “Odd Minimum Cut-Sets and B-Matchings”, Math. of Operations Research, Vol. 7 No. 1 (1982), pp. 67–80.
Roberts, F.S. and J. Spencer, “A Characterization of Clique Graphs”, Combinatorial Structures and Their Applications, proceedings from Calgary, Alberta, Canada, June 1969, pp. 367–368.
Seymour, P.D. “Matroids with the Max-Flow Min-Cut Property”, Journal of Combinatorial Theory Series B 23 (1977), pp. 189–222.
Stone, A.H. “Some Combinatorial Problems in General Topology”, Combinatorial Structures and Their Applications, proceedings from Calgary, Alberta, Canada, June 1969, pp. 413–416.
Tutte, W.T. “Lectures on Matroids”, Journal of Research of the National Bureau of Standards Section B 69 pp. 1–47, 1965.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Johnson, E.L. (2000). Chinese Postman and Euler Tour Problems in Bi-Directed Graphs. In: Dror, M. (eds) Arc Routing. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4495-1_5
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4495-1_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7026-0
Online ISBN: 978-1-4615-4495-1
eBook Packages: Springer Book Archive