This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems;... read more
Customers who bought this book also bought:
Our Editors also recommend:
Optimization Theory with Applications by Donald A. Pierre Broad-spectrum approach to important topic. Explores the classic theory of minima and maxima, classical calculus of variations, simplex technique and linear programming, optimality and dynamic programming, more. 1969 edition.
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.
Methods of Operations Research by Philip M. Morse, George E. Kimball, Dr. Saul I. Gass Operations research originated during World War II with the military's need for a scientific method of providing executives with a quantitative decision-making basis. This text explores strategical kinematics, tactical analysis, gunnery and bombardment problems, more.
Matroid Theory by D. J. A. Welsh Text by a noted expert describes standard examples and investigation results, using elementary proofs to develop basic matroid properties before advancing to a more sophisticated treatment. Includes numerous exercises. 1976 edition.
An Introduction to Identification by J. P. Norton Suitable for advanced undergraduates and graduate students, this text covers the theoretical basis for mathematical modeling as well as a variety of identification algorithms and their applications. 1986 edition.
This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly.
Reprint of the Prentice-Hall, Englewood Cliffs, New Jersey, 1982 edition.
This book was printed in the United States of America.
Dover books are made to last a lifetime. Our US book-manufacturing partners produce the highest quality books in the world and they create jobs for our fellow citizens. Manufacturing in the United States also ensures that our books are printed in an environmentally friendly fashion, on paper sourced from responsibly managed forests.