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 |
In |
Springer e-books |
Subject |
Network analysis (Planning) -- Mathematical models
|
|
Mathematical optimization.
|
|
BUSINESS & ECONOMICS -- Decision-Making & Problem Solving.
|
|
Mathematical optimization.
|
|
Network analysis (Planning) -- Mathematical models.
|
|
Mathematical optimization
|
|
Network analysis (Planning) -- Mathematical models
|
Form |
Electronic book
|
Author |
Sha, Dan.
|
|
Wong, C. K.
|
ISBN |
0387712143 |
|
9780387712147 |
|
9780387712154 |
|
0387712151 |
|
9786610902422 |
|
6610902429 |
|