000 05411nam a22003975i 4500
001 280864
003 MX-SnUAN
005 20160429154040.0
007 cr nn 008mamaa
008 150903s2009 xxu| o |||| 0|eng d
020 _a9780387888439
_99780387888439
024 7 _a10.1007/9780387888439
_2doi
035 _avtls000333259
039 9 _a201509030227
_bVLOAD
_c201404130405
_dVLOAD
_c201404092153
_dVLOAD
_y201402041106
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA75.5-76.95
100 1 _aChinneck, John W.
_eeditor.
_9303713
245 1 0 _aOperations Research and Cyber-Infrastructure /
_cedited by John W. Chinneck, Bjarni Kristjansson, Matthew J. Saltzman.
264 1 _aBoston, MA :
_bSpringer US :
_bImprint: Springer,
_c2009.
300 _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 _aOperations Research/Computer Science Interfaces,
_x1387-666X ;
_v47
500 _aSpringer eBooks
505 0 _aPython Optimization Modeling Objects (Pyomo) -- Object Oriented Modeling of Multistage Stochastic Linear Programs -- Aeon: Synthesizing Scheduling Algorithms from High-Level Models -- Optimization -- A Branch-and-cut Algorithm for Integer Bilevel Linear Programs -- A Principled Approach to Mixed Integer/Linear Problem Formulation -- Experiments with Branching using General Disjunctions -- A Weight Annealing Algorithm for Solving Two-dimensional Bin Packing Problems -- Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm -- Combinatorial Design of a Stochastic Markov Decision Process -- A Primal-Dual Slack Approach to Warmstarting Interior-Point Methods for Linear Programming -- Linear Dynamic Programming and the Training of Sequence Estimators -- Applications -- Approximate Algorithms for Maximizing the Capacity of the Reverse Link in Multiple–Class CDMA Systems -- Mathematical Formulations and Metaheuristics Comparison for the Push-Tree Problem -- Two-Edge Disjoint Survivable Network Design Problem with Relays -- Generating Random Test Networks for Shortest Path Algorithms -- A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions -- Using Oriented Random Search to Provide a Set of Alternative Solutions to the Capacitated Vehicle Routing Problem -- Optimizing Paths in the Presence of Spherical Impediments -- Tailoring Classifier Hyperplanes to General Metrics -- The Multi-Sensor Nuclear Threat Detection Problem -- Radiotherapy optimAl Design: An Academic Radiotherapy Treatment Design System -- Integrated Forecasting and Inventory Control for Seasonal Demand -- A Provably Good Global Routing Algorithm in Multilayer IC and MCM Layout Designs -- Eliminating Poisson's Spot with Linear Programming.
520 _aOperations Research and Cyber-Infrastructure is the companion volume to the Eleventh INFORMS Computing Society Conference (ICS 2009), held in Charleston, South Carolina, from January 11 to 13, 2009. It includes 24 high-quality refereed research papers. As always, the focus of interest for ICS is the interface between Operations Research and Computer Science, and the papers in this volume reflect that interest. This is naturally an evolving area as computational power increases rapidly while decreasing in cost even more quickly. The papers included here illustrate the wide range of topics at this interface. For convenience, they are grouped in broad categories and subcategories. There are three papers on modeling, reflecting the impact of recent development in computing on that area. Eight papers are on optimization (three on integer programming, two on heuristics, and three on general topics, of which two involve stochastic/probabilistic processes). Finally, there are thirteen papers on applications (three on the conference theme of cyber-infrastructure, four on routing, and six on other interesting topics). Several of the papers could be classified in more than one way, reflecting the interactions between these topic areas. About the Editors John W. Chinneck is a professor in the Department of Systems and Computer Engineering at Carleton University, Ottawa, Canada. He is the Editor-in-Chief of the INFORMS Journal of Computing; a member of the editorial board of Computational Management Science; and Past Chair of the INFORMS Computing Society. Bjarni Kristjansson is the founder of Maximal Software, a leading worldwide provider of software for developing and formulating models in the field of optimization. Matthew Saltzman is an Associate Professor of Mathematical Sciences at Clemson University, Clemson, South Carolina. His research areas of interest are in Computational Operations Research and Mathematical Programming.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aKristjansson, Bjarni.
_eeditor.
_9306091
700 1 _aSaltzman, Matthew J.
_eeditor.
_9306092
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9780387888422
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-0-387-88843-9
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c280864
_d280864