Become a Readings Member to make your shopping experience even easier. Sign in or sign up for free!

Become a Readings Member. Sign in or sign up for free!

Hello Readings Member! Go to the member centre to view your orders, change your details, or view your lists, or sign out.

Hello Readings Member! Go to the member centre or sign out.

Time-Varying Network Optimization
Hardback

Time-Varying Network Optimization

$130.99
Sign in or become a Readings Member to add this title to your wishlist.

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

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.

Read More
In Shop
Out of stock
Shipping & Delivery

$9.00 standard shipping within Australia
FREE standard shipping within Australia for orders over $100.00
Express & International shipping calculated at checkout

MORE INFO
Format
Hardback
Publisher
Springer-Verlag New York Inc.
Country
United States
Date
4 May 2007
Pages
248
ISBN
9780387712147

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

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.

Read More
Format
Hardback
Publisher
Springer-Verlag New York Inc.
Country
United States
Date
4 May 2007
Pages
248
ISBN
9780387712147