中文

Operations Research Transactions >

2015 , Vol. 19 >Issue 3: 1 - 7

DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2015.03.001

A historical review on the research and development

Expand
  • 1. College of Management, Fudan University, Shanghai,200433, China

Received date: 2015-04-15

  Online published: 2015-09-15

Fold

Abstract

The Chinese postman problem is one of the fundamental problems in operations research. This paper reviews the development of the problem, starting from its inception to its current status.

Key words： shortest path problem; graphical method for transportation; Chinese postman problem

Cite this article

GUAN Meigu . A historical review on the research and development[J]. Operations Research Transactions, 2015 , 19(3) : 1 -7 . DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.001

References

管梅谷.  奇偶点图上作业法[J]. 数学学报, 1960, 10: 263-266.
Edmonds J. The Chinese postman problem [J].  Operations Research, 1965, 13 (Supplement): 1-73.
Edmonds J. Paths, trees and flowers [J].  Canadian Journal of Mathematics}, 1965, 17: 449-467.
Edmonds J. Maximum matching and a polyhedron with 0,1-vertices [J].  Journal of Research of the NationalBureau of Standards, 1965, 69B: 125-130.
Eiselt H A,  Gendreau M, Laporte G. Arc routing problems, Part 1: The Chinese Postman Problem [J]. Operations Research, 1965, 43: 231-242.
Eiselt H A,  Gendreau M,  Laporte G. Arc routing problems, Part 2: The Rural Postman Problem [J]. Operations Research, 1965, 43: 399-414.
Dror M. Arc Routing: Theory, Solutions and Applications [M].  Boston： Kluwer Academic Publishers, 2000.
Corberan A,  Laporte G. Arc routing: problems, methods and applications [J].  MOS-SIAM Series on   Optimization, 2014.
Barahona F. On some applications of the Chinese Postman Problem [R]. Combinatorics  Optimization,   Research Report CORR88-55, University of Waterloo, 1988.
Edmonds J,  Johnson E. Matching, Euler tour and the Chinese Postman Problem [J]. Mathematical    Programming, 1973, 5: 88-124.
Korte B. Applications of Combinatorial Optimization, Mathematical Programming: Recent Development and Applications  [M]. Tokyo: Kluwer, 1989, 1-55.
王元. 华罗庚[M]. 北京：开明出版社，1994.
Grotschel M,  Yuan Y X.  Euler, Mei-Ko Kwan, Konisberg, and a Chinese Postman [J]. Documenta   Mathematica, 2012, 43-50.
Flood M. The travelling salesman problem [J].Operations Research, 1956, 4: 61-75.
管梅谷. 图上作业法的改进[J].  数学学报, 1960, 10: 267-275.
Busacker R G,  Saaty T L. Finite Graphs and Networks [M]. New York: McGraw-Hill, 1965.
 Kwan Mei-Ko. Graphic programming using odd or even points [J].  Chinese Mathematics, 1962, 1: 273-277.
Bellman R, Cooke K. The Konigsberg bridges problem generalized [J].  Journal of Mathematical Analysis  and Applications, 1969, 25: 1-7.
Stricker R. Public Sector Vehicle Routing, the Chinese Postman Problem [M]. Cambridge:  Department of Electrical Engineering, MIT, 1970.
Christofides N. The optimal traversal of a graph [J].  Omega, 1973, 1: 719-732.
 Beltrami E, Bodin L. Networks and vehicle routing for municipal waste collection [J].  Networks, 1974, 4: 65-94.
Bodin L, Kursh S. A Computer-Assisted System for the Routing and Scheduling of Street Sweepers [J]. Operations Research, 1978, 26: 525-537.
Papadimitriou H. On the complexity of edge traversing [J].  Journal of the Association for Computing  Machinery, 1976, 23: 544-554.
 Golden B, Wong R. Capacitated arc routing problems [J]. Networks, 1981, 11: 105-115.
Fleischner H.  Eulerian Graphs and Related Topics [M]. North-Holland: Elsevier Science Ltd, 1990.
 Win Z. Contributions to Routing Problem, Doctoral Dissertation [M]. Bavaria: University Augsberg, 1987.
Gass S,  Assad A. An Annotated Timeline of Operations Research, An Informal History [M].  Boston: Springer Science Business Media, 2007.
谷超豪. 数学词典[M].  上海: 上海辞书出版社, 1992: 581.
数学名词审定委员会. 数学名词[M]. 北京: 科学出版社, 1993: 253.
胡毓达主编. 数学辞海(第五卷)—运筹学[M]. 山西教育出版社、东南大学出版社、中国科学技术出版社，2002: 102.
Options
Outlines

/

〈 〉