Operations Research and Cyber-Infrastructure / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
Used and New from Other Sellers
Used and New from Other Sellers
from $1.99
Usually ships in 1-2 business days
(Save 99%)
Other sellers (Hardcover)
  • All (11) from $1.99   
  • New (6) from $90.17   
  • Used (5) from $1.99   


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.
Read More Show Less

Editorial Reviews

From the Publisher
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)

Read More Show Less

Product Details

Table of Contents

Preface.- Python optimization modeling objects.- Object oriented modeling of multistage shastic 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 shastic 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.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star


4 Star


3 Star


2 Star


1 Star


Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation


  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)