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.
"Sinopsis" puede pertenecer a otra edición de este libro.
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 world networks" may change over time. Problems such as how to plan and control the transmission of flow becomes very important, because waiting at a node, or traveling along a particular arc with different speed, may allow one to catch the best timing along the path; thus, achieving the objective and changing the decision making process. It should be noted that there are a host of decision making problems in practice that should be formulated as optimization models on time-varying networks.
The express purpose of TIME-VARYING NETWORK OPTIMIZATION is to describe, in a unified and self-contained manner, 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. The book consists of eight chapters, in which the following problems are formulated and examined: (1) the shortest path problem, (2) minimum-spanning tree problem, (3) maximum flow problem, (4) minimum cost flow problem, (5) maximum capacity path problem, (6) quickest path problem, (7) multi-criteria problem, and (8) the generalized flow problem. 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 will be described all within the framework of time-varying networks, our plan is to make each chapter relatively self-contained so that each can read separately.
The book will be useful for researchers, practitioners, graduate students and senior undergraduates, as a unified reference and textbook on time-varying network optimization. While the book describes the structure of the algorithms, the authors also have developed the software that implements the algorithms. This software can be made available for academic study purposes upon request.
"Sobre este título" puede pertenecer a otra edición de este libro.
EUR 6,90 gastos de envío desde Alemania a España
Destinos, gastos y plazos de envíoEUR 10,55 gastos de envío desde Reino Unido a España
Destinos, gastos y plazos de envíoLibrería: Buchpark, Trebbin, Alemania
Condición: Sehr gut. Zustand: Sehr gut | Seiten: 244 | Sprache: Englisch | Produktart: Bücher. Nº de ref. del artículo: 3595803/12
Cantidad disponible: 1 disponibles
Librería: Books From California, Simi Valley, CA, Estados Unidos de America
hardcover. Condición: Good. Ex- library book with stamps/ stickers. Nº de ref. del artículo: mon0003288841
Cantidad disponible: 1 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. pp. 244 Illus. Nº de ref. del artículo: 7594682
Cantidad disponible: 1 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. pp. 244. Nº de ref. del artículo: 26286053
Cantidad disponible: 1 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. pp. 244. Nº de ref. del artículo: 18286063
Cantidad disponible: 1 disponibles
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
Condición: 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. Nº de ref. del artículo: ABNR-75906
Cantidad disponible: 5 disponibles
Librería: Romtrade Corp., STERLING HEIGHTS, MI, Estados Unidos de America
Condición: 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. Nº de ref. del artículo: ABNR-92914
Cantidad disponible: 1 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Buch. 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. Nº de ref. del artículo: 9780387712147
Cantidad disponible: 2 disponibles
Librería: Basi6 International, Irving, TX, Estados Unidos de America
Condición: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Nº de ref. del artículo: ABEJUNE24-87502
Cantidad disponible: Más de 20 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9780387712147_new
Cantidad disponible: Más de 20 disponibles