Operations Research and Cyber-Infrastructure

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Chinneck, John W. (Επιμελητής έκδοσης), Kristjansson, Bjarni (Επιμελητής έκδοσης), Saltzman, Matthew J. (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Boston, MA : Springer US : Imprint: Springer, 2009.
• Σειρά: Operations Research/Computer Science Interfaces, 47
• Θέματα: Computer science.; Organization.; Planning.; Management.; Industrial management.; Operations research.; Decision making.; Information technology.; Business > Data processing.; Computers.; Artificial intelligence.; Computer Science.; Information Systems and Communication Service.; Operation Research/Decision Theory.; Artificial Intelligence (incl. Robotics).; Innovation/Technology Management.; IT in Business.

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

Πίνακας περιεχομένων:

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