Operations Research and Cyber-Infrastructure

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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. 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.

Author(s): William E. Hart (auth.), John W. Chinneck, Bjarni Kristjansson, Matthew J. Saltzman (eds.)
Series: Operations Research/Computer Science Interfaces 47
Edition: 1
Publisher: Springer US
Year: 2009

Language: English
Pages: 462
Tags: Information Systems and Communication Service; Operation Research/Decision Theory; Artificial Intelligence (incl. Robotics); Organization/Planning; Innovation/Technology Management; Business Information Systems

Front Matter....Pages i-xi
Front Matter....Pages 11-11
Python Optimization Modeling Objects (Pyomo)....Pages 3-19
Object Oriented Modeling of Multistage Stochastic Linear Programs....Pages 21-41
Aeon: Synthesizing Scheduling Algorithms from High-Level Models....Pages 43-59
Front Matter....Pages 67-67
A Branch-and-cut Algorithm for Integer Bilevel Linear Programs....Pages 65-78
A Principled Approach to Mixed Integer/Linear Problem Formulation....Pages 79-100
Experiments with Branching using General Disjunctions....Pages 101-118
A Weight Annealing Algorithm for Solving Two-dimensional Bin Packing Problems....Pages 121-146
Solving the Maximum Cardinality Bin Packing Problem with a Weight Annealing-Based Algorithm....Pages 147-164
Combinatorial Design of a Stochastic Markov Decision Process....Pages 167-193
A Primal-Dual Slack Approach to Warmstarting Interior-Point Methods for Linear Programming....Pages 195-217
Linear Dynamic Programming and the Training of Sequence Estimators....Pages 219-231
Front Matter....Pages 232-232
Approximate Algorithms for Maximizing the Capacity of the Reverse Link in Multiple–Class CDMA Systems....Pages 237-252
Mathematical Formulations and Metaheuristics Comparison for the Push-Tree Problem....Pages 253-278
Two-Edge Disjoint Survivable Network Design Problem with Relays....Pages 279-292
Generating Random Test Networks for Shortest Path Algorithms....Pages 295-308
A Branch-and-Price Algorithm for Combined Location and Routing Problems Under Capacity Restrictions....Pages 309-330
Using Oriented Random Search to Provide a Set of Alternative Solutions to the Capacitated Vehicle Routing Problem....Pages 331-345
Optimizing Paths in the Presence of Spherical Impediments....Pages 347-361
Tailoring Classifier Hyperplanes to General Metrics....Pages 365-387
The Multi-Sensor Nuclear Threat Detection Problem....Pages 389-399
Front Matter....Pages 232-232
Radiotherapy optimAl Design: An Academic Radiotherapy Treatment Design System....Pages 401-425
Integrated Forecasting and Inventory Control for Seasonal Demand....Pages 427-441
A Provably Good Global Routing Algorithm in Multilayer IC and MCM Layout Designs....Pages 443-454
Eliminating Poisson's Spot with Linear Programming....Pages 455-467
Back Matter....Pages 469-471