Clearly written 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; approximation algorithms, local search heuristics for NP-complete problems, more. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly. 1982 edition..
Like free samples?Click here to get new ones every week.
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.
Combinatorial Group Theory: Presentations of Groups in Terms of Generators and Relations by Wilhelm Magnus, Abraham Karrass, 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 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.
