TIME-VARYING NETWORK OPTIMIZATION

• Main Author: Cai, Xiaoqiang (Author)
• Other Authors: Sha, Dan, Wong, C. K.
• Format: Book Chapter
• Language: English
• Published: New York, NY Springer 2007
• Series: International series in operations research & management science ; 103
• Subjects: Network analysis (Planning) > Mathematical models; Mathematical optimization
• Online Access: Click Here to View Status and Holdings.

 Network ?ow optimization problems may arise in a wide variety of important ?elds, such as transportation, telecommunication, computer networking, ?nancial planning, logistics and supply chain management, energy systems, etc. Signi?cant and elegant results have been achieved onthetheory,algorithms,andapplications,ofnetwork?owoptimization in the past few decades; See, for example, the seminal books written by Ahuja, Magnanti and Orlin (1993), Bazaraa, Jarvis and Sherali (1990), Bertsekas (1998), Ford and Fulkerson (1962), Gupta (1985), Iri (1969), Jensen and Barnes (1980), Lawler (1976), and Minieka (1978). Most network optimization problems that have been studied up to date are, however, static in nature, in the sense that it is assumed that it takes zero time to traverse any arc in a network and that all attributes of the network are constant without change at any time.