Combinatorial Optimization - Algorithms and Complexity (Paperback, New 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. 1982 ed.

General

Imprint:	Dover Publications Inc.
Country of origin:	United States
Release date:	February 2000
First published:	1998
Authors:	Christos H. Papadimitriou • Kenneth Steiglitz
Dimensions:	216 x 140 x 25mm (L x W x T)
Format:	Paperback
Pages:	496
Edition:	New edition
ISBN-13:	978-0-486-40258-1
Categories:	Books > Science & Mathematics > Mathematics > Combinatorics & graph theory Books > Science & Mathematics > Mathematics > Optimization > General Books > Academic & Education > Varsity Textbooks > Technology Books > Academic & Education > Varsity Textbooks > Mathematics & Science Books > Academic & Education > UNISA > Mathematics & Science Books > Academic & Education > UNISA > Technology
LSN:	0-486-40258-4
Barcode:	9780486402581
Course Code:	HONOPTR

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!