Combinatorial Optimization: Algorithms and Complexity (Paperback)
$20.89 - Save $1.06 (4%) - RRP $21.95 Free shipping worldwide (to United States and
all these other countries) Usually dispatched within 48 hours
Short Description for Combinatorial Optimization 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.
- Published: 01 February 2000
- Format: Paperback 528 pages
- ISBN 13: 9780486402581 ISBN 10: 0486402584
- Sales rank: 140,181
Full description for Combinatorial Optimization
This book brings together in one volume the important ideas of computational complexity developed by computer scientists with the foundations of mathematical programming developed by the operations research community.