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.
Publisher: Springer-Verlag New York Inc.
Number of pages: 248
Weight: 404 g
Dimensions: 235 x 155 x 13 mm
Edition: Softcover reprint of hardcover 1st ed. 2007
From the reviews:
"This monograph provides a unified framework for a series of models and algorithms to study flow optimization problems in time-varying networks. ... the topics covered by this monograph make it useful for graduate students as a textbook and are of interest for engineers and researchers working on time-varying network optimization problems." (Francesc Comellas, Mathematical Reviews, Issue 2009 b)
You may also be interested in...
Please sign in to write a review