 Computer Science is Dover's latest math and science category. We look forward to publishing many exciting texts and reprinting classic theoretical works that study the theoretical foundations of information and computation as well as the practical techniques for their implementation and application. An interdisciplinary area important to mathematicians, engineers, and scientists, Operations Research focuses upon the effective use of technology to solve complex problems. Dover is proud to feature important operations research texts in Linear Programming by Saul I. Gass, Mathematical Programming by Steven Vajda, Mordecai Avriel's Nonlinear Programming and books by Richard Bellman and Eric Denardo.
To visit our main Math and Science Shop, please click here. And be sure to join our Math and Science Club for a 20% everyday discount, free newsletter, and other exclusive benefits.
Recommendations... Combinatorial Optimization: Algorithms and Complexity
by Christos H. Papadimitriou, Kenneth Steiglitz
This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.
|  |
| |  Mathematical Programming
by Steven Vajda
This classic by a well-known expert explores both theory and applications. It focuses on linear programming, in addition to other programming topics, and features numerous worked-out examples and problems. 1961 edition.
| |
|
 Computability and Unsolvability
by Prof. Martin Davis
Classic graduate-level introduction to theory of computability. Discusses general theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, more.
| |
| |  Fractals, Chaos, Power Laws: Minutes from an Infinite Paradise
by Manfred Schroeder
A fascinating exploration of the connections between chaos theory, physics, biology, and mathematics, this book abounds in award-winning computer graphics, optical illusions, and games that clarify memorable insights into self-similarity. 1992 edition.
| |
|
 Elementary Decision Theory
by Herman Chernoff, Lincoln E. Moses
This well-respected introduction to statistics and statistical theory covers data processing, probability and random variables, utility and descriptive statistics, computation of Bayes strategies, models, testing hypotheses, and much more. 1959 edition.
| |
| |  An Introduction to Mathematical Modeling
by Edward A. Bender
Accessible text features over 100 reality-based examples pulled from the science, engineering and operations research fields. Prerequisites: ordinary differential equations, continuous probability. Numerous references. Includes 27 black-and-white figures. 1978 edition.
| |
|
|
Products in Computer Science and Operations Research | | | |  | Boolean Algebra and Its Applications
by J. Eldon Whitesitt
Introductory treatment begins with set theory and fundamentals of Boolean algebra, proceeding to concise accounts of applications to symbolic logic, switching circuits, relay circuits, binary arithmetic, and probability theory. 1961 edition.
|
| | Combinatorial Optimization: Algorithms and Complexity
by Christos H. Papadimitriou, Kenneth Steiglitz
This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition.
|
|  | Common LISP: A Gentle Introduction to Symbolic Computation
by David S. Touretzky
Highly accessible treatment covers cons cell structures, evaluation rules, programs as data, recursive and applicable programming styles. Nearly 400 illustrations, answers to exercises, "toolkit" sections, and a variety of complete programs. 1990 edition.
|
|  | Communication Nets: Stochastic Message Flow and Delay
by Leonard Kleinrock
This text develops a queuing theory model of communications nets. Its realistic assessment of factors involved in message flow will benefit those working with computers and other communications systems. 1964 edition.
|
| | Computability and Unsolvability
by Prof. Martin Davis
Classic graduate-level introduction to theory of computability. Discusses general theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, more.
|
|  | Computer-Controlled Systems: Theory and Design, Third Edition
by Dr. Karl J Åström, Dr. Björn Wittenmark
This volume features computational tools that can be applied directly and are explained with simple calculations, plus an emphasis on control system principles and ideas. Includes worked examples, MATLAB macros, and solutions manual.
|
|  | Data Structures and Algorithm Analysis in C++, Third Edition
by Dr. Clifford A. Shaffer
Comprehensive treatment focuses on creation of efficient data structures and algorithms and selection or design of data structure best suited to specific problems. This edition uses C++ as the programming language.
|
| |  | Discrete Optimization Algorithms: with Pascal Programs
by Maciej M. Syslo, Narsingh Deo, Janusz S. Kowalik
Upper-level undergraduates and graduate students will benefit from this treatment of discrete optimization algorithms, which covers linear and integer programming and offers a collection of ready-to-use computer programs. 1983 edition.
|
|  | Dynamic Programming
by Richard Bellman
Introduction to mathematical theory of multistage decision processes takes a "functional equation" approach. Topics include existence and uniqueness theorems, optimal inventory equation, bottleneck problems, multistage games, Markovian decision processes, and more. 1957 edition.
|
|  | Dynamic Programming: Models and Applications
by Eric V. Denardo
Introduction to sequential decision processes covers use of dynamic programming in studying models of resource allocation, methods for approximating solutions of control problems in continuous time, production control, more. 1982 edition.
|
| | Elementary Decision Theory
by Herman Chernoff, Lincoln E. Moses
This well-respected introduction to statistics and statistical theory covers data processing, probability and random variables, utility and descriptive statistics, computation of Bayes strategies, models, testing hypotheses, and much more. 1959 edition.
|
|  | Foundations of Combinatorics with Applications
by Edward A. Bender, S. Gill Williamson
Suitable for upper-level undergraduates and graduate students in engineering, science, and mathematics, this introductory text explores counting and listing, graphs, induction and recursion, and generating functions. Includes numerous exercises (some with solutions), notes, and references.
|
| | Fractals, Chaos, Power Laws: Minutes from an Infinite Paradise
by Manfred Schroeder
A fascinating exploration of the connections between chaos theory, physics, biology, and mathematics, this book abounds in award-winning computer graphics, optical illusions, and games that clarify memorable insights into self-similarity. 1992 edition.
|
|  | An Illustrated Guide to Linear Programming
by Dr. Saul I. Gass
Entertaining, nontechnical introduction covers basic concepts of linear programming and its relationship to operations research; geometric interpretation and problem solving, solution techniques, network problems, much more. Only high-school algebra needed.
|
| | | An Introduction to Mathematical Modeling
by Edward A. Bender
Accessible text features over 100 reality-based examples pulled from the science, engineering and operations research fields. Prerequisites: ordinary differential equations, continuous probability. Numerous references. Includes 27 black-and-white figures. 1978 edition.
|
|  | Introductory Discrete Mathematics
by V. K . Balakrishnan
This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. More than 200 exercises, many with complete solutions. 1991 edition.
|
|  | Linear Programming and Economic Analysis
by Robert Dorfman, Paul A. Samuelson, Robert M. Solow
Clear, comprehensive exposition of interrelation of game theory and linear programming, interrelation of linear programming and modern welfare economics, Leontief theory of input-output, problems of dynamic linear programming, more.
|
|
|
|
|