|
![]() |
|||
|
||||
OverviewFull Product DetailsAuthor: John W. Chinneck , Bjarni Kristjansson , Matthew J. SaltzmanPublisher: Springer-Verlag New York Inc. Imprint: Springer-Verlag New York Inc. Edition: Softcover reprint of hardcover 1st ed. 2009 Volume: 47 Dimensions: Width: 15.50cm , Height: 2.40cm , Length: 23.50cm Weight: 0.736kg ISBN: 9781441947024ISBN 10: 1441947027 Pages: 462 Publication Date: 23 November 2010 Audience: Professional and scholarly , Professional & Vocational Format: Paperback Publisher's Status: Active Availability: Out of print, replaced by POD ![]() We will order this item for you from a manufatured on demand supplier. Table of ContentsPython 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.ReviewsFrom 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) 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) Author InformationTab Content 6Author Website:Countries AvailableAll regions |