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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
