Computer Science and Operations Research
New Developments in Their Interfaces
This item is unavailable.
We will email you if this item comes back into stock.
|Format:||Hardback, 548 pages|
|Other Information: ||Illustrations|
|Published In: ||Netherlands, 01 July 1992|
The interface of Operation Research and Computer Science - although elusive to a precise definition - has been a fertile area of both methodological and applied research. The papers in this book, written by experts in their respective fields, convey the current state-of-the-art in this interface across a broad spectrum of research domains which include optimization techniques, linear programming, interior point algorithms, networks, computer graphics in operations research, parallel algorithms and implementations, planning and scheduling, genetic algorithms, heuristic search techniques and data retrieval.
Table of Contents
Chapter headings and selected papers: Preface. Referees. Optimization Techniques. A principled approach to solving complex discrete optimization problems, B Macleod & R Moll. Boolean-combinatorial bounding of maximum 2-satisfiability, J-M Bourjolly et al. Linear Programming Interior Point Algorithms. Adapting the interior point method for the solution of linear programs on high performance computers, J Andersen et al. Networks. Alternate server disciplines for mobile-servers on a congested network, S K Park et al. Minimum graph vertex covering with the random neural network, E Gelenbe & F Batty. Computer Graphics in Operations Research. EDINET - A network editor for transshipment problems with facility location, W Ogryczak et al. Parallel Algorithms and Implementations. Computational experience with parallel algorithms for solving the quadratic assignment problem, P M Pardalos et al. On reporting the speedup of parallel algorithms: a survey of issues and experts, R S Barr & B L Hickman. Planning and Scheduling. Intelligent modelling, simulation and scheduling of discrete production processes, J Paredis & T van Rij. OOFP - object oriented flow planning, W Mergenthaler et al. Genetic Algorithms. Increased flexibility in genetic algorithms: the use of variable Boltzmann selective pressure to control propagation, M de la Maza & B Tidor. Heuristic Search Techniques. Heuristic solution procedures for the graph partitioning problem, E Rolland & H Pirkul. Data Retrieval. Enhancing data retrieval using artificially synthesized queries, B J Oommen & D T H Ng. Author Index. Subject Index.