Cargando…
Time-Varying Network Optimization
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...
| Clasificación: | Libro Electrónico |
|---|---|
| Autores principales: | , |
| Autor Corporativo: | |
| Formato: | Electrónico eBook |
| Idioma: | Inglés |
| Publicado: |
New York, NY :
Springer US : Imprint: Springer,
2007.
|
| Edición: | 1st ed. 2007. |
| Colección: | International Series in Operations Research & Management Science,
103 |
| Temas: | |
| Acceso en línea: | Texto Completo |
MARC
| LEADER | 00000nam a22000005i 4500 | ||
|---|---|---|---|
| 001 | 978-0-387-71215-4 | ||
| 003 | DE-He213 | ||
| 005 | 20220119015231.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 100301s2007 xxu| s |||| 0|eng d | ||
| 020 | |a 9780387712154 |9 978-0-387-71215-4 | ||
| 024 | 7 | |a 10.1007/0-387-71215-1 |2 doi | |
| 050 | 4 | |a TK5105.5-5105.9 | |
| 072 | 7 | |a UKN |2 bicssc | |
| 072 | 7 | |a COM075000 |2 bisacsh | |
| 072 | 7 | |a UKN |2 thema | |
| 082 | 0 | 4 | |a 004.6 |2 23 |
| 100 | 1 | |a Sha, Dan. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 245 | 1 | 0 | |a Time-Varying Network Optimization |h [electronic resource] / |c by Dan Sha, C. K. Wong. |
| 250 | |a 1st ed. 2007. | ||
| 264 | 1 | |a New York, NY : |b Springer US : |b Imprint: Springer, |c 2007. | |
| 300 | |a XVI, 248 p. 63 illus. |b online resource. | ||
| 336 | |a text |b txt |2 rdacontent | ||
| 337 | |a computer |b c |2 rdamedia | ||
| 338 | |a online resource |b cr |2 rdacarrier | ||
| 347 | |a text file |b PDF |2 rda | ||
| 490 | 1 | |a International Series in Operations Research & Management Science, |x 2214-7934 ; |v 103 | |
| 505 | 0 | |a 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. | |
| 520 | |a 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. | ||
| 650 | 0 | |a Computer networks . | |
| 650 | 0 | |a Operations research. | |
| 650 | 0 | |a Mathematical optimization. | |
| 650 | 0 | |a Management science. | |
| 650 | 0 | |a Application software. | |
| 650 | 1 | 4 | |a Computer Communication Networks. |
| 650 | 2 | 4 | |a Operations Research and Decision Theory. |
| 650 | 2 | 4 | |a Optimization. |
| 650 | 2 | 4 | |a Operations Research, Management Science . |
| 650 | 2 | 4 | |a Computer and Information Systems Applications. |
| 700 | 1 | |a Wong, C. K. |e author. |4 aut |4 http://id.loc.gov/vocabulary/relators/aut | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 773 | 0 | |t Springer Nature eBook | |
| 776 | 0 | 8 | |i Printed edition: |z 9781441943873 |
| 776 | 0 | 8 | |i Printed edition: |z 9780387518329 |
| 776 | 0 | 8 | |i Printed edition: |z 9780387712147 |
| 830 | 0 | |a International Series in Operations Research & Management Science, |x 2214-7934 ; |v 103 | |
| 856 | 4 | 0 | |u https://doi.uam.elogim.com/10.1007/0-387-71215-1 |z Texto Completo |
| 912 | |a ZDB-2-SCS | ||
| 912 | |a ZDB-2-SXCS | ||
| 950 | |a Computer Science (SpringerNature-11645) | ||
| 950 | |a Computer Science (R0) (SpringerNature-43710) | ||