ARC Routing - Corberán, Ángel; Laporte, Gilbert
94,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
payback
47 °P sammeln
  • Broschiertes Buch

This book provides a thorough and up-to-date discussion of arc routing by world-renowned researchers. Organized by problem type, the book offers a rigorous treatment of complexity issues, models, algorithms, and applications. Arc Routing opens with a historical perspective of the field and is followed by three sections that cover: 1. Complexity and the Chinese Postman and the Rural Postman problems. 2. The Capacitated Arc Routing Problem and routing problems with min-max and profit maximization objectives. 3. Important applications, including meter reading, snow removal, and waste collection.

Andere Kunden interessierten sich auch für
Produktbeschreibung
This book provides a thorough and up-to-date discussion of arc routing by world-renowned researchers. Organized by problem type, the book offers a rigorous treatment of complexity issues, models, algorithms, and applications. Arc Routing opens with a historical perspective of the field and is followed by three sections that cover: 1. Complexity and the Chinese Postman and the Rural Postman problems. 2. The Capacitated Arc Routing Problem and routing problems with min-max and profit maximization objectives. 3. Important applications, including meter reading, snow removal, and waste collection.
Autorenporträt
Ángel Corberán is a Professor of Statistics and Operations Research at the Faculty of Mathematics of the University of Valencia. He started studying arc routing problems 35 years ago under the supervision of Professor Nicos Christofides of the Imperial College. He has published more than 60 papers in combinatorial optimization and is coordinating editor of Computational Optimization and Applications and a member of the editorial board of Computers and Operations Research, the EURO Journal on Transportation and Logistics, and the EURO Journal on Computational Optimization. His research interests concern the study and solution of combinatorial optimization problems, mainly in the routing and location areas.