Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Combinatorial Optimization
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 Modelling Techniques
"Engaging, elegantly written." — Applied Mathematical Modelling Mathematical modelling is a highly useful methodology designed to enable mathematicians, physicists and other scientists to formulate equations from a given nonmathematical situation. In this elegantly written volume, a distinguished theoretical chemist and engineer sets down helpful rules not only for setting up models but also for solving the mathematical problems they pose and for evaluating models. The author begins with a discussion of the term "model," followed by clearly presented examples of the different types of models (finite, statistical, stochastic, etc.). He then goes on to discuss the formulation of a model and ...
Real Computing Made Real
This concise guide to trouble-shooting offers practical advice on detecting and removing the bugs, preserving significant figures, avoiding extraneous solutions, and finding efficient iterative processes for solving nonlinear equations. 1996 edition.
Combinatorics for Computer Science
Useful guide covers two major subdivisions of combinatorics — enumeration and graph theory — with emphasis on conceptual needs of computer science. Each part is divided into a "basic concepts" chapter emphasizing intuitive needs of the subject, followed by four "topics" chapters that explore these ideas in depth. Invaluable practical resource for graduate students, advanced undergraduates, and professionals with an interest in algorithm design and other aspects of computer science and combinatorics. References for Linear Order & for Graphs, Trees, and Recursions. 219 figures.
An Introduction to Mathematical Modeling
Employing a practical, "learn by doing" approach, this first-rate text fosters the development of the skills beyond the pure mathematics needed to set up and manipulate mathematical models. The author draws on a diversity of fields — including science, engineering, and operations research — to provide over 100 reality-based examples. Students learn from the examples by applying mathematical methods to formulate, analyze, and criticize models. Extensive documentation, consisting of over 150 references, supplements the models, encouraging further research on models of particular interest. The lively and accessible text requires only minimal scientific background. Designed for senior colleg...
Dynamic Programming
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.
Introductory Discrete Mathematics
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.
Mathematical Economics
Graduate-level text provides complete and rigorous expositions of economic models analyzed primarily from the point of view of their mathematical properties, followed by relevant mathematical reviews. Part I covers optimizing theory; Parts II and III survey static and dynamic economic models; and Part IV contains the mathematical reviews, which range fromn linear algebra to point-to-set mappings.
Multiobjective Programming and Planning
This text takes a broad view of multiobjective programming, emphasizing the methods most useful for continuous problems. It reviews methods in the context of public decision-making problems. 1978 edition.
Logic for Computer Science
This advanced text for undergraduate and graduate students introduces mathematical logic with an emphasis on proof theory and procedures for algorithmic construction of formal proofs. The self-contained treatment is also useful for computer scientists and mathematically inclined readers interested in the formalization of proofs and basics of automatic theorem proving. Topics include propositional logic and its resolution, first-order logic, Gentzen's cut elimination theorem and applications, and Gentzen's sharpened Hauptsatz and Herbrand's theorem. Additional subjects include resolution in first-order logic; SLD-resolution, logic programming, and the foundations of PROLOG; and many-sorted first-order logic. Numerous problems appear throughout the book, and two Appendixes provide practical background information.
