Beschreibung
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.
Inhaltsverzeichnis
Preface.- Python optimization modeling objects.- Object oriented modeling of multistage stochastic linear programs.- AEON: synthesizing scheduling algorithms from high-level models.- A branch-and-cut algorithm for integer bi-level 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 sequences estimators.- 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 text 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.- Index.
Autorenporträt
InhaltsangabePython 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.
