You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
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.
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.
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.
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...
"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 ...
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.
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.
Designed both for those who seek an acquaintance with dynamic programming and for those wishing to become experts, this text is accessible to anyone who's taken a course in operations research. It starts with a basic introduction to sequential decision processes and proceeds to the use of dynamic programming in studying models of resource allocation. Subsequent topics include methods for approximating solutions of control problems in continuous time, production control, decision-making in the face of an uncertain future, and inventory control models. The final chapter introduces sequential decision processes that lack fixed planning horizons, and the supplementary chapters treat data structures and the basic properties of convex functions. 1982 edition. Preface to the Dover Edition.
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.
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.