Operations research and cyber-infrastructure

Operations Research and Cyber-Infrastructure is an attractive and important topic for the field of Operations Research and Management Science to feature. This volume explores work in high-performance computing and communications, data management, analysis, visualization, virtual organization, and learning and workforce development. The concepts and research are illustrated and highlighted with methodologies such as: design and analysis of algorithms, heuristic search, modeling languages, parallel and distributive computing, simulation, andcomputational logic. The book emphasizes the new and novel applications at the interface of CS, AI, and OR/MS. Matthew Saltzman and John Chinneck are well-known researchers in computation OR with international reputations. Bjarni Kristjansson is the founder and CEO of Maximal Software Inc. - a company that produces modeling software used in solving OR/MS problems in research and industry. Operations Research and Cyber-Infrastructure offers high quality information and communication infrastructure to support advanced operations research methodology in Optimization and Computing While software is available for use in real-world applications, its use in distributed environments is still a challenge for major advances Volume provides a wealth of methods and ideas to support these developing areas INDICE: From the contents 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 andmetaheuristics comparison for the push-tree problem.

• ISBN: 978-0-387-88842-2
• Editorial: Springer
• Encuadernacion: Cartoné
• Páginas: 462
• Fecha Publicación: 01/01/2009
• Nº Volúmenes: 1
• Idioma: Inglés