9780387712147 - Time-Varying Network Optimization (International Series in Operations Research & Management Science, 103, Band 103) von Sha, Dan; Wong, C. K. (7 Ergebnisse)

hardcover. Zustand: Good. Ex- library book with stamps/ stickers.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Hardcover. Zustand: Brand New. 1st edition. 223 pages. 9.25x6.00x0.75 inches. In Stock.

Zustand: New. This text describes 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. Series: International Series in Operations Research & Management Science. Num Pages: 248 pages, 63 black & white illustrations, 14 black & white tables, biography. BIC Classification: UT. Category: (P) Professional & Vocational. Dimension: 241 x 154 x 20. Weight in Grams: 524. . 2007. Hardback. . . . . Books ship from the US and Ireland.

Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | 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 very important, since waiting at a node, or travelling along a particular arc with di?erent speed, may allow one to catch the best timing along his path, and therefore achieve his overall objective, such as a minimum overall cost or a minimum travel time from the origin to the destination.

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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 very important, since waiting at a node, or travelling along a particular arc with di erent speed, may allow one to catch the best timing along his path, and therefore achieve his overall objective, such as a minimum overall cost or a minimum travel time from the origin to the destination.