Operations Research and Cyber-Infrastructure

By John W. Chinneck , Bjarni Kristjansson , Matthew J. Saltzman

Operations Research and Cyber-Infrastructure Cover Image

  • ISBN13: 978-0-3878-8842-2
  • 470 Pages
  • User Level: Science
  • Publication Date: January 5, 2009
  • Available eBook Formats: PDF
  • eBook Price: $189.00
Buy eBook Buy Print Book Add to Wishlist
Full Description
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.
Table of Contents

Table of Contents

  1. Preface.
  2. Python optimization modeling objects.
  3. Object oriented modeling of multistage stochastic linear programs.
  4. AEON: synthesizing scheduling algorithms from high
  5. level models.
  6. A branch
  7. and
  8. cut algorithm for integer bi
  9. level linear programs.
  10. A principled approach to mixed integer/linear problem formulation.
  11. Experiments with branching using general disjunctions.
  12. A weight annealing algorithm for solving two
  13. dimensional bin packing problems.
  14. Solving the maximum cardinality bin packing problem with a weight annealing
  15. based algorithm.
  16. Combinatorial design of a stochastic Markov decision process.
  17. A primal
  18. dual slack approach to warmstarting interior
  19. point methods for linear programming.
  20. Linear dynamic programming and the training of sequences estimators.
  21. Approximate algorithms for maximizing the capacity of the reverse link in multiple
  22. class CDMA systems.
  23. Mathematical formulations and metaheuristics comparison for the push
  24. tree problem.
  25. Two
  26. edge disjoint survivable network design problem with relays.
  27. Generating random text networks for shortest path algorithms.
  28. A branch
  29. and
  30. price algorithm for combined location and routing problems under capacity restrictions.
  31. Using oriented random search to provide a set of alternative solutions to the capacitated vehicle routing problem.
  32. Optimizing paths in the presence of spherical impediments.
  33. Tailoring classifier hyperplanes to general metrics.
  34. The multi
  35. sensor nuclear threat detection problem.
  36. Radiotherapy optimal design: an academic radiotherapy treatment design system.
  37. Integrated forecasting and inventory control for seasonal demand.
  38. A provably good global routing algorithm in multilayer IC and MCM layout designs.
  39. Eliminating Poisson’s spot with linear programming.
  40. Index.
Errata

Please Login to submit errata.

No errata are currently published