Combinatorial Optimization: Algorithm and Complexity

Front Cover
Prentice Hall, 1982 - Mathematics - 496 pages
1 Review
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

We haven't found any reviews in the usual places.

Contents

Chapter
18
THE SIMPLEX ALGORITHM
26
DUALITY
67
Copyright

16 other sections not shown

Other editions - View all

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