Combinatorial Optimization: Algorithm and Complexity

Front Cover
Prentice Hall, 1982 - Mathematics - 496 pages
2 Reviews
Christos H. Papadimitriou and Kenneth Steiglitz have combined the theory of computational complexity developed by computer scientists, and the foundations of mathematical programming developed by the operations research community. This text will be useful to students with a wide range of backgrounds, including computer science, operations research, and electrical engineering.

From inside the book

What people are saying - Write a review

Review: Combinatorial Optimization: Algorithms and Complexity

User Review  - DJ - Goodreads

another gem from Dover Read full review

Review: Combinatorial Optimization: Algorithms and Complexity

User Review  - dead letter office - Goodreads

a $19 classic text on combinatorial optimization. thank you dover. Read full review

Contents

Chapter
18
THE SIMPLEX ALGORITHM
26
DUALITY
67
Copyright

16 other sections not shown

Common terms and phrases

References to this book

All Book Search results »

About the author (1982)

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.

Bibliographic information