The bridges of königsberg - A historical perspective

Networks

Volumn 49, Issue 3, 2007, Pages 199-203

  Gribkovskaia, Irina ^a   Halskau Sr , Øyvind ^a   Laporte, Gilbert ^b  

^a MOLDE UNIVERSITY COLLEGE   (Norway)

^b HEC MONTRÉAL   (Canada)

Author keywords

arc routing; Euler; Graph theory; History

Indexed keywords

EULER EQUATIONS; NUMERICAL METHODS;

ARC ROUTING; HISTORICAL INFORMATION;

GRAPH THEORY;

EID: 34247542692     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20159     Document Type: Review

References (15)

1. A.A. Assad and B.L. Golden, Arc routing methods and applications, Network routing, M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser (Editors), Handbooks in Operations, Research and Management Science, North-Holland, Amsterdam, 1995, pp. 375-483.
2. B. Bartfeld, Königsberg, Russian Europe, Kaliningrad, 2005.
3. N.L. Biggs, K.E. Lloyd, and R. Wilson, Graph theory, 1736-1936, Clarendon Press, Oxford, 1976.
4. J. Edmonds and E.L. Johnson, Matching, Euler tours and the Chinese postman problem, Math Program 5 (1973), 88-124.
5. H.A. Eiselt, M. Gendreau, and G. Laporte, Arc routing problems, part I: The Chinese postman problem, Oper Res 43 (1995), 231-242.
6. H.A. Eiselt, M. Gendreau, and G. Laporte, Arc routing problems, part II: The rural postman problem, Oper Res 43 (1995), 399-414.
7. H.A. Eiselt and G. Laporte, A historical perspective on arc routing, Arc routing: Theory, solutions and applications, M. Dror (Editor), Kluwer, Boston, 2000.
8. L. Euler, Solutio problematis ad geometriam situs pertinents, Comment Acad Sci Imperialis Petropolit 8 (1736), 128-140.
9. H. Fleischner, Eulerian graphs and related topics (Part 1, Volume 1), Annals of discrete mathematics, vol. 50, North-Holland, Amsterdam, 1991.
10. L.R. Ford and D.R. Fulkerson, Flows in networks, Princeton University Press, Princeton, NJ, 1962.
11. M. Guan, Graphic programming using odd and even points, Chin Math 1 (1962), 273-277.
12. C. Hierholzer, Über die Möglichkeit, einen Linienzug ohne Widerholung und ohne Unterbrechnung zu umfahren, Mate Ann VI (1873), 30-32.
13. J.R. Newman (Editor), Leohnard Euler and the Koenigsberg bridges, Sci Ame 189 (1953), 66-70.
14. C.S. Orloff, A fundamental problem in vehicle routing, Networks 4 (1974), 35-64.
15. The New Encyclopædia Britannica, 15th edition, Encyclopæ-dia Britannica Inc., Chicago, 1994.