000			04412nam a22003975i 4500
001			280297
003			MX-SnUAN
005			20160429154018.0
007			cr nn 008mamaa
008			150903s2007 xxu| o |||| 0|eng d
020			_a9780387712154 _99780387712154
024	7		_a10.1007/0387712151 _2doi
035			_avtls000332120
039		9	_a201509030721 _bVLOAD _c201404120632 _dVLOAD _c201404090412 _dVLOAD _y201402041021 _zstaff
040			_aMX-SnUAN _bspa _cMX-SnUAN _erda
050		4	_aHD30.23
100	1		_aCai, Xiaoqiang. _eautor _9305137
245	1	0	_aTime-Varying Network Optimization / _cby Xiaoqiang Cai, Dan Sha, C. K. Wong.
264		1	_aBoston, MA : _bSpringer US, _c2007.
300			_axvI, 223 páginas _brecurso en línea.
336			_atexto _btxt _2rdacontent
337			_acomputadora _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_aarchivo de texto _bPDF _2rda
490	0		_aInternational Series in Operations Research & Management Science, _x0884-8289 ; _v103
500			_aSpringer eBooks
505	0		_aTime-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			_aNetwork 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.
590			_aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700	1		_aSha, Dan. _eautor _9305138
700	1		_aWong, C. K. _eautor _9305139
710	2		_aSpringerLink (Servicio en línea) _9299170
776	0	8	_iEdición impresa: _z9780387712147
856	4	0	_uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/0-387-71215-1 _zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942			_c14
999			_c280297 _d280297