Time-Varying Network Optimization

You must be logged in to access this title.

Sign up now

Already a member? Log in

Synopsis

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.

Book details

Edition:
2007
Series:
International Series in Operations Research & Management Science (Book 103)
Author:
Dan Sha, C. K. Wong
ISBN:
9780387712154
Related ISBNs:
9780387712147
Publisher:
Springer US
Pages:
N/A
Reading age:
Not specified
Includes images:
No
Date of addition:
2021-02-09
Usage restrictions:
Copyright
Copyright date:
2007
Copyright by:
N/A 
Adult content:
No
Language:
English
Categories:
Business and Finance, Computers and Internet, Mathematics and Statistics, Nonfiction