Combinatorial optimization

Combinatorial optimization: algorithms and complexity

by Papadimitriou, Christos H.

Type Book
Rate 0.0 /5

A text for a range of graduate courses, with some of the material suitable for students of computer science with a background in the theory of algorithms and some suitable for those with a background in operations research. Corrected and unabridged from the 1982 publication by Prentice-Hall, with a new preface. Annotation copyrighted by Book News, Inc., Portland, OR.

Read More ↓
Details
Files
Reviews
Download

Title Statements

  • Full title :Combinatorial optimization : algorithms and complexity / Christos H. Papadimitriou, Kenneth Steiglitz.

Summary

A text for a range of graduate courses, with some of the material suitable for students of computer science with a background in the theory of algorithms and some suitable for those with a background in operations research. Corrected and unabridged from the 1982 publication by Prentice-Hall, with a new preface. Annotation copyrighted by Book News, Inc., Portland, OR.

Read More ↓

Edition Statements

  • Publication Date:1998.

Publication Statements

  • Publisher(s):Dover Publications
  • Place of Publication:Mineola, N.Y
  • Language:eng
  • Publication Date:1998.

Notes

Originally published: Englewood Cliffs, N.J. : Prentice Hall, ©1982. With new pref.

The Physical Object

  • Description:xvi, 496 pages : : illustrations ; : 22 cm

Edition Identifiers

  • ISBN:0486402584, 9780486402581
  • oclc:ocm38989881
  • LC Classification:QA402.5
  • Dewey Decimal:519.3

Table of Contents

Optimization problems -- Simplex algorithm -- Duality -- Computational considerations for the simplex algorithm -- 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-plane algorithm for integer linear programs -- NP-complete problems -- More about NP-completeness -- Approximation algorithms -- Branch-and-bound and dynamic programming -- Local search.

Read More ↓

Subjects

Algorithmes -- Informatique Combinatieleer Combinatorial optimization Complexité de calcul (Informatique) Complexiteit Computational complexity Kombinatorik Kombinatorische Optimierung Mathematical optimization Mathematische programmering Optimierung Optimisation combinatoire Optimisation mathématique Programmation (Mathématiques)

Writers

Papadimitriou, Christos H. Steiglitz, Kenneth

Rate & Review

0.0/5
(0 people Voted)

No reviews yet. Be the first to rate this work.

Files & Downloads

  • Combinatorial optimization: algorithms and comple…

    DJVU · 3.9 MB · updated
    Login →

  • Combinatorial Optimization: Algorithms and Comple…

    DJVU · 19.3 MB · updated
    Login →

  • Combinatorial Optimization: Algorithms and Comple…

    DJVU · 4.0 MB · updated
    Login →

  • Combinatorial Optimization: Algorithms and Comple…

    PDF · 31.3 MB · updated
    Login →