Time-Varying Network Optimization

Sha, Dan; Wong, C. K.

ISBN 10: 0387712143 / ISBN 13: 9780387712147

Edité par Springer, 2007

A propos de cet article

This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

N° de réf. du vendeur ABNR-75906

Détails bibliographiques

• Titre: Time-Varying Network Optimization
• Éditeur: Springer
• Date de parution: 2007
• Langue: anglais
• ISBN à 10 chiffres: 0387712143
• ISBN à 13 chiffres: 9780387712147
• Reliure: Couverture rigide
• État de l'article: New

A propos de ce titre

Synopsis

The express purpose of Time-Varying Network Optimization is to describe, in a unified and self-contained manner, a series of models, propositions, and algorithms developed in recent years on time-varying networks. References and discussions on relevant problems and studies that have appeared in the literature are integrated in the book. The book consists of eight chapters, in which the following problems are formulated and examined: (1) the shortest path problem, (2) minimum-spanning tree problem, (3) maximum flow problem, (4) minimum cost flow problem, (5) maximum capacity path problem, (6) quickest path problem, (7) multi-criteria problem, and (8) the generalized flow problem. The book will be useful for researchers, practitioners, graduate students and senior undergraduates, as a unified reference and textbook on time-varying network optimization. While the book describes the structure of the algorithms, the authors also have developed software that implements the algorithms.

Présentation de l'éditeur

This text describes a series of models, propositions, and algorithms developed in recent years on time-varying networks. References and discussions on relevant problems and studies that have appeared in the literature are integrated in the book. Its eight chapters consider problems including the shortest path problem, the minimum-spanning tree problem, the maximum flow problem, and many more. The time-varying traveling salesman problem and the Chinese postman problem are presented in a chapter together with the time-varying generalized problem. While these topics are examined within the framework of time-varying networks, each chapter is self-contained so that each can be read - and used - separately.