|By Subject > Science and Mathematics > Computer Science and Operations Research > 2 > Combinatorial Optimization: Algorithms and Complexity|
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.
|Combinatorial Optimization: Algorithms and Complexity|
|Author:||Christos H. Papadimitriou, Kenneth Steiglitz|
|Dimensions:||5 3/8 x 8 1/2|
Reprint of the Prentice-Hall, Englewood Cliffs, New Jersey, 1982 edition.
|Ready to Buy?|
Add this to your cart
(you can always remove it later.)
Shopping here is Guaranteed Safe!
|Here's a sample of other Dover titles that may interest your customers.|
|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 Janusz S. Kowalik
Maciej M. Syslo
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.
|Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations|
by Donald Solitar
A seminal, much-cited account of combinatorial group theory — co-authored by a distinguished teacher of mathematics and a pair of his colleagues — this text for graduate students features numerous helpful exercises. Second, revised 1976 edition.
|Methods of Operations Research|
by Dr. Saul I. Gass
Philip M. Morse
George E. Kimball
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. read more
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. read more
|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. read more