Limit search to available items
Book Cover
Author Cai, Xiaoqiang.

Title Time-varying network optimization / Xiaoqiang Cai, Dan Sha, C.K. Wong
Published New York, NY : Springer, [2007]
Online access available from:
Springer eBooks    View Resource Record  


Description 1 online resource (xvi, 223 pages) : illustrations
Series International series in operations research & management science ; 103
International series in operations research & management science ; 103
Contents Front Matter; Time-Varying Shortest Path Problems; Time-Varying Minimum Spanning Trees; Time-Varying Universal Maximum Flow Problems; Time-Varying Minimum Cost Flow Problems; Time-Varying Maximum Capacity Path Problems; The Quickest Path Problem; Finding the Best Path with Multi-Criteria; Generalized Flows and Other Network Problems; Back Matter
Summary 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
Bibliography Includes bibliographical references (pages 207-217) and index
Subject Network analysis (Planning) -- Mathematical models.
Mathematical optimization.
Form Electronic book
Author Sha, Dan.
Wong, C. K.
LC no. 2007922440
ISBN 0387712143