Image from Google Jackets

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

By: Contributor(s): Material type: TextTextLanguage: İngilizce Publisher: Mineola, N.Y. : Dover Publications, 1998Description: xvi, 496 pages : illustrations ; 22 cmContent type:
  • text
Media type:
  • unmediated
Carrier type:
  • volume
ISBN:
  • 0486402584 (pbk.)
  • 9780486402581 (pbk.)
Subject(s): LOC classification:
  • QA402.5 .P37 1998
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
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Home library Collection Call number Copy number Status Notes Date due Barcode
Book Book Merkez Kütüphane Genel Koleksiyon / Main Collection Merkez Kütüphane Genel Koleksiyon QA402.5 .P37 1998 (Browse shelf(Opens below)) 1 Available Donated by Tuğçe Yücel 0061972

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

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

Donated by Tuğçe Yücel

There are no comments on this title.

to post a comment.
Devinim Yazılım Eğitim Danışmanlık tarafından Koha'nın orjinal sürümü uyarlanarak geliştirilip kurulmuştur.