| 书目名称 | Time-Varying Network Optimization | | 编辑 | Xiaoqiang Cai,Dan Sha,C. K. Wong | | 视频video | | | 概述 | Addresses two types of needs in the research of network optimization: 1) to present the latest research efforts and findings on time-varying network optimization; and 2) to examine key models and resu | | 丛书名称 | International Series in Operations Research & Management Science | | 图书封面 |  | | 描述 | 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. Networks in the real world are, nevertheless, time-varying in essence, in which any ?ow must take a certain amount of time to traverse an arc and the network structure and parameters (such as arc and node capacities) may change over time. In such a problem, how to plan and control the transmission of ?ow becomes ver | | 出版日期 | Textbook 2007 | | 关键词 | Chinese postman problem; Host; computer network; maximum capacity path; maximum/ minimum cost flow; minim | | 版次 | 1 | | doi | https://doi.org/10.1007/0-387-71215-1 | | isbn_softcover | 978-1-4419-4387-3 | | isbn_ebook | 978-0-387-71215-4Series ISSN 0884-8289 Series E-ISSN 2214-7934 | | issn_series | 0884-8289 | | copyright | Springer-Verlag US 2007 |
The information of publication is updating
|
|
发表于 2025-3-21 19:42:38
