Edward Grady Coffman, J. K. Lenstra, A. H. G. Rinnooy Kan
North-Holland, Jan 1, 1992 - Business & Economics - 682 pages
Hardbound. The chapters in this volume can be grouped into three parts. Part I provides an introductory course in the design and operation of computers and computer systems. It conveys a knowledge of the basic principles of computer systems along with perspectives on the history and future of computers. The study of algorithmics is contained in Part II including matrix computations, fundamental algorithms and data structures, design and analysis of efficient algorithms, and computational complexity. Part III brings out the relation between computer systems and operations research applications.This volume was designed and written for use in the operations research and management science community. Apart from the background provided by the first five chapters, the emphasis is on the computational tools, algorithms, languages, and systems that assist the problem solver.
43 pages matching evaluation in this book
Results 1-3 of 43
What people are saying - Write a review
We haven't found any reviews in the usual places.
The influence of advances in technology
Current and future developments
66 other sections not shown
algebra algorithm analysis application approach augmentation path basic binary binary tree block bound called Cholesky column complexity computer systems data structures Database Systems decision problem defined Dinits discussed disk distributed edge efficient eigenvalues evaluation example execution factorization function given hardware Hence IEEE implementation input instance integer interactive iteration label layered graph linear logical machine mathematical matrix maximum flow memory method minimum minimum cut modules network flow node NP-complete object object-oriented operating system optimization output pair parallel path perfect matching performance phase pointer polynomial polynomial-time Proc procedure processors programming languages queue recursive red-black tree relational residual graph result scheduling strategy search trees Section sequence serializability server SIAM solution solved specification splay trees Tarjan techniques Theorem tion transaction transformation update user interface variables vector vertex cover