Combinatorial Optimization, 9780486402581
Paperback
Solve complex problems: Algorithms, networks, and NP-completeness explained clearly.

Combinatorial Optimization

algorithms and complexity

$76.54

  • Paperback

    528 pages

  • Release Date

    1 February 2000

Check Delivery Options

Summary

Unlocking the Power of Optimization: A Combinatorial Journey

This clearly written, mathematically rigorous text provides a fresh algorithmic perspective on the simplex method. Explore the Soviet ellipsoid algorithm for linear programming, efficient algorithms for network flow, matching, spanning trees, and matroids. Delve into the theory of NP-complete problems, approximation algorithms, and local search heuristics.

Each chapter is enriched with thought-provoking problems, m…

Book Details

ISBN-13:9780486402581
ISBN-10:0486402584
Series:Dover Books on Computer Science
Author:Christos H. Papadimitriou
Publisher:Dover Publications Inc.
Imprint:Dover Publications Inc.
Format:Paperback
Number of Pages:528
Edition:New edition
Release Date:1 February 2000
Weight:625g
Dimensions:216mm x 141mm x 27mm
About The Author

Christos H. Papadimitriou

Christos H. Papadimitriou is C. Lester Hogan Professor of Electrical Engineering and Computer Sciences at the University of California, Berkeley, where he has taught since 1996 and where he is a former Miller Fellow.

Returns

This item is eligible for free returns within 30 days of delivery. See our returns policy for further details.