BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

TIME-VARYING NETWORK OPTIMIZATION

TIME-VARYING NETWORK OPTIMIZATION

TIME-VARYING NETWORK OPTIMIZATION
Stock photo: cover may vary

TIME-VARYING NETWORK OPTIMIZATION Hardback - 2007

by Dan Sha; C. K. Wong

Add to wish list
  • New
New

Description

New.
Ask the seller a question Add to wish list
A$70.96
A$21.71 Delivery to USA
Standard delivery: 20 to 30 days
More delivery options
Ships from Sanctum Books (Delhi, India)

Details

  • Title TIME-VARYING NETWORK OPTIMIZATION
  • Author Dan Sha; C. K. Wong
  • Binding Hardback
  • Edition U. S. EDITION
  • Condition New
  • Pages 248
  • Volumes 1
  • Language ENG
  • Publisher Springer
  • Publication date 2007-05-04
  • Illustrated Yes
  • Features Bibliography, Illustrated, Index, Table of Contents
  • Bookseller's Inventory # BWP-9780387712147
  • ISBN 9780387712147 / 0387712143
  • Weight 1.15 lbs (0.52 kg)
  • Dimensions 9.45 x 6.31 x 0.74 in (24.00 x 16.03 x 1.88 cm)
  • Category Business / Economics / Finance
  • Library of Congress subjects Mathematical optimization, Network analysis (Planning) - Mathematical
  • Library of Congress Catalogue Number 2007922440
  • Dewey Decimal Code 658.403
  • Quantity available 500

About Sanctum Books Delhi, India

Biblio member since 2010

We are leading publishers, booksellers, distributors, importers, and exporters. We carry a large selection of books on varied subjects. Do place your valued order or let us know your requirement via email.

Terms of Sale:

30 day return guarantee, with full refund including shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Books are shipped by Registered Air Mail or DHL/FedEx/Aramex. Additional shipping charges may be required for multi-volume sets.

Browse books from Sanctum Books

Reader reviews for TIME-VARYING NETWORK OPTIMIZATION

From the publisher

The express purpose of Time-Varying Network Optimization is to describe, in a unified and self-contained manner, 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. The book consists of eight chapters, in which the following problems are formulated and examined: (1) the shortest path problem, (2) minimum-spanning tree problem, (3) maximum flow problem, (4) minimum cost flow problem, (5) maximum capacity path problem, (6) quickest path problem, (7) multi-criteria problem, and (8) the generalized flow problem. The book will be useful for researchers, practitioners, graduate students and senior undergraduates, as a unified reference and textbook on time-varying network optimization. While the book describes the structure of the algorithms, the authors also have developed software that implements the algorithms.

From the rear cover

Network flow optimization analyzes optimization problems on networks; hence, network optimization is reflected in many application fields including transportation, telecommunication, computer networking, financial planning, logistics and supply chain management, energy systems, etc. However, to date, most network optimization problems that have been studied are static network optimization problems. But "real world networks" are time-varying in essence, and therefore any flow within a network must take a certain amount of time to traverse an arc. Moreover, the parameters of "real world networks" may change over time. Problems such as how to plan and control the transmission of flow becomes very important, because waiting at a node, or traveling along a particular arc with different speed, may allow one to catch the best timing along the path; thus, achieving the objective and changing the decision making process. It should be noted that there are a host of decision making problems in practice that should be formulated as optimization models on time-varying networks.

The express purpose of TIME-VARYING NETWORK OPTIMIZATION is to describe, in a unified and self-contained manner, 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. The book consists of eight chapters, in which the following problems are formulated and examined: (1) the shortest path problem, (2) minimum-spanning tree problem, (3) maximum flow problem, (4) minimum cost flow problem, (5) maximum capacity path problem, (6) quickest path problem, (7) multi-criteria problem, and (8) the generalized flow problem. 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 will be described all within the framework of time-varying networks, our plan is to make each chapter relatively self-contained so that each can read separately.

The book will be useful for researchers, practitioners, graduate students and senior undergraduates, as a unified reference and textbook on time-varying network optimization. While the book describes the structure of the algorithms, the authors also have developed the software that implements the algorithms. This software can be made available for academic study purposes upon request.

tracking-