Sha / Wong Time-Varying Network Optimization

1. Auflage 2007
ISBN: 978-0-387-71215-4
Verlag: Springer US
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 264 Seiten, Web PDF

Reihe: Computer Science (R0)

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.

Zielgruppe

Research

Autoren/Hrsg.

Sha, Dan

Wong, C. K.

Inhaltsverzeichnis

Time-Varying Shortest Path Problems.- Time-Varying Minimum Spanning Trees.- Time-Varying Universal Maximum Flow Problems.- Time-Varying Minimum Cost Flow Problems.- Time-Varying Maximum Capacity Path Problems.- The Quickest Path Problem.- Finding the Best Path with Multi-Criteria.- Generalized Flows and Other Network Problems.