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.
Or split into 4x interest-free payments of 25% on orders over R50
Learn more
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.
Imprint | Springer-Verlag New York |
Country of origin | United States |
Series | International Series in Operations Research & Management Science, 103 |
Release date | November 2010 |
Availability | Expected to ship within 10 - 15 working days |
First published | 2007 |
Authors | Dan Sha, C.K. Wong |
Dimensions | 235 x 155 x 13mm (L x W x T) |
Format | Paperback |
Pages | 248 |
Edition | Softcover reprint of hardcover 1st ed. 2007 |
ISBN-13 | 978-1-4419-4387-3 |
Barcode | 9781441943873 |
Categories | |
LSN | 1-4419-4387-0 |