9781441943873 - Time-Varying Network Optimization: 103 (International Series in Operations Research & Management Science) de Sha, Dan; Wong, C. K. (12 resultados)

Taschenbuch. Condición: 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.

Paperback. Condición: Brand New. 248 pages. 8.90x5.90x0.70 inches. In Stock.

Condición: New. pp. 244.

Condición: New. In.

PF. Condición: New.

Condición: New.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. Its eight chapters consider problems including the shortest path problem, the minimum-spanning tree problem, the maximum flow problem, and many more. The time-varying traveling salesman problem and the Chinese postman problem are presented in a chapter together with the time-varying generalized problem. While these topics are examined within the framework of time-varying networks, each chapter is self-contained so that each can be read - and used - separately. 244 pp. Englisch.

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 results on dynamic network optimization problems that can .

Paperback / softback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 378.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 244 pp. Englisch.

Condición: New. Print on Demand pp. 244 63 Illus.

Condición: New. PRINT ON DEMAND pp. 244.