Can I read Combinatorial Optimization : Algorithms and Complexity on EtoBox?

Combinatorial Optimization : Algorithms and Complexity by Christos H. Papadimitriou, Kenneth Steiglitz,Prentice Hall is a reference work available to read on EtoBox.

What is Combinatorial Optimization : Algorithms and Complexity about?

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. Optimization Problems -- The Simplex Algorithm -- Duality -- Computational Considerations For The Simplex Algorithm -- The Primal-dual Algorithm -- Primal-dual Algorithms For Max-flow And Shortest Path: Ford-fulkerson And Dijkstra -- Primal-dual Algorithms For Min-cost Flow -- Algorithms And Complexity -- Efficient Algorithms For The Max-flow Problem -- Algorithms For Matching -- Weighted Matching -- Spanning Trees And Matroids -- Integer Linear Programming -- A Cutting-lane Algorithm For Integer Linear Programs -- Np-complete Problems -- More About Np-completeness -- Approximation Algorithms -- Branch-and-bound And Dynamic Programming -- Local Search. Christos H. Papadimitriou, Kenneth Steiglitz. Includes Bibliographical References And Index.

Who reads Combinatorial Optimization : Algorithms and Complexity?

Author

Christos H. Papadimitriou, Kenneth Steiglitz,Prentice Hall

Publisher

Prentice-Hall, Inc

Published

1982

Language

EN

ISBN

9780486402581

Category

reference

Subjects

Mathematics, Reference, Stem

Rating

3.98 / 5 (81 ratings)

Updated

2026-03-13