Operations Research and Cyber-Infrastructure
1st Edition
Published on 5. January 2009
VIII, 462 pages
978-0-387-88843-9 (ISBN)
Description
Operations 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, and the papers included here illustrate the wide range of topics at this interface.
Reviews / Votes
From the reviews: "This book is the companion volume to the INFORMS Computing Society Conference held in January 2009, and that the focus of the conference was on the interface between Operations Research and Computer Science. . a valuable resource for graduate students looking for promising areas of research and for faculty wishing to bring themselves up to date on work in progress on the OR/CS interface. . an excellent addition to libraries of institutions in which there are graduate students in OR, or in Computer Science." (R. Bharath, Journal of the Operational Research Society, Vol. 61 (5), 2010)More details
Other editions
Additional editions
John W. Chinneck | Bjarni Kristjansson | Matthew J. Saltzman
Operations Research and Cyber-Infrastructure
Book
01/2009
Springer
€213.99
Shipment within 5-7 days
Content
Python 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.
