Arc Routing

Theory, Solutions and Applications

  • Moshe Dror

Table of contents

  1. Front Matter
    Pages i-xxiv
  2. A Historical Perspective on Arc Routing

    1. H. A. Eiselt, Gilbert Laporte
      Pages 1-16
  3. Theory

    1. Front Matter
      Pages 17-17
  4. Solutions

    1. Front Matter
      Pages 197-197
    2. Richard W. Eglese, Adam N. Letchford
      Pages 199-230
    3. E. Benavent, A. Corberán, J. M. Sanchis
      Pages 231-275
    4. Alain Hertz, Michel Mittaz
      Pages 327-386
  5. Applications

    1. Front Matter
      Pages 387-387
    2. James F. Campbell, André Langevin
      Pages 389-418
    3. Moshe Dror, Janny M. Y. Leung, Paul A. Mullaseril
      Pages 443-464
  6. Back Matter
    Pages 465-483

About this book


Arc Routing: Theory, Solutions and Applications is about arc traversal and the wide variety of arc routing problems, which has had its foundations in the modern graph theory work of Leonhard Euler. Arc routing methods and computation has become a fundamental optimization concept in operations research and has numerous applications in transportation, telecommunications, manufacturing, the Internet, and many other areas of modern life. The book draws from a variety of sources including the traveling salesman problem (TSP) and graph theory, which are used and studied by operations research, engineers, computer scientists, and mathematicians. In the last ten years or so, there has been extensive coverage of arc routing problems in the research literature, especially from a graph theory perspective; however, the field has not had the benefit of a uniform, systematic treatment. With this book, there is now a single volume that focuses on state-of-the-art exposition of arc routing problems, that explores its graph theoretical foundations, and that presents a number of solution methodologies in a variety of application settings. Moshe Dror has succeeded in working with an elite group of ARC routing scholars to develop the highest quality treatment of the current state-of-the-art in arc routing.


Graph Graph theory Matching Node Polyhedral Theory algorithms linear optimization operations research optimization

Editors and affiliations

  • Moshe Dror
    • 1
  1. 1.Department of Management Information SystemsUniversity of ArizonaTucsonUSA

Bibliographic information

  • DOI
  • Copyright Information Springer Science+Business Media New York 2000
  • Publisher Name Springer, Boston, MA
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4613-7026-0
  • Online ISBN 978-1-4615-4495-1
  • Buy this book on publisher's site