Cantitate/Preț
Produs

Arc Routing: Theory, Solutions and Applications

Editat de Moshe Dror
en Limba Engleză Hardback – 30 aug 2000
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 282734 lei  6-8 săpt.
  Springer Us – 3 oct 2012 282734 lei  6-8 săpt.
Hardback (1) 283398 lei  6-8 săpt.
  Springer Us – 30 aug 2000 283398 lei  6-8 săpt.

Preț: 283398 lei

Preț vechi: 354248 lei
-20% Nou

Puncte Express: 4251

Preț estimativ în valută:
54254 56394$ 44982£

Carte tipărită la comandă

Livrare economică 07-21 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780792378983
ISBN-10: 0792378989
Pagini: 516
Ilustrații: XXIV, 483 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.89 kg
Ediția:2000
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States

Public țintă

Research

Descriere

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.

Cuprins

Preface. Contributing Authors. 1. A Historical Perspective on Arc Routing; H.A. Eiselt, G. Laporte. Part I. Theory: 2. Traversing Graphs: The Eulerian and Hamiltonian Theme; h. Fleischner. 3. Matching: Arc Routing and Solution Connection; U. Derigs. 4. Arc Routing: Complexity and Approximability; M. Dror. 5. Chinese Postman and Euler Tour Problems in Bi-directed Graphs; E.L.Johnson. Part II. Solutions: 6. Polyhedral Theory for Arc Routing Problems; R.W. Eglese, A.N. Letchford. 7. Linear Programming Based Methods for Solving Arc Routing Problems; E. Benavent, et al. 8. Transformations and Exact Node Routing Solutions by Column Generation; M. Dror, A. Langevin. 9. Heuristic Algorithms; A. Hertz, M. Mittaz. Part III. Applications: 10. Roadway Snow and Ice Control; J.F. Campbell, A. Langevin. 11. Scheduling of Local Delivery Carrier Routes for the United States Postal Service; L. Bodin, L. Levy. 12. Livestock Feed Distribution and Arc Traversal Problems; M. Dror, et al.