Amazon kapak resmi
Amazon.com'dan alınan resim
Özel kapak resmi
Özel kapak resmi

Network flows : theory, algorithms, and applications / Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin.

Yazar: Katkıda bulunan(lar):Dil: İngilizce Seri kaydı: Always learningYayın ayrıntıları:Edinburgh, England : Pearson, 2014.Baskı: Pearson new international editionTanım: xv, 846 p. ; ill., 24 cmISBN:
  • 9781292042701 (pbk.)
Konu(lar): LOC sınıflandırması:
  • T 57.85 .A38 2014
İçindekiler:
Paths, trees, and cycles -- Algorithm design and analysis -- Shortest paths : label-setting algorithms -- Shortest paths : label-correcting algorithms -- Maximum flows : basic ideas -- Maximum flows : polynomial algorithms -- Maximum flows : additional topics -- Minimum cost flows : basic algorithms -- Minimum cost flows : polynomial algorithms -- Minimum cost flows : network simplex algorithms -- Assignments and matchings -- Minimum spanning trees -- Convex cost flows -- Generalized flows -- Lagrangian relaxation and network optimization -- Multicommodity flows -- Computational testing of algorithms -- Additional applications.
Özet: Among all topics covered in operations research, network flows theory offers the best context to illustrate the basic concepts of optimization. This book provides an integrative view of the theory, algorithms and applications of network flows. In order for their presentation to be more intuitive and accessible to a wider audience, the authors prefer to adopt a network or graphical viewpoint rather than relying on a linear programming approach.
Yıldız derecelendirmeleri
    Ortalama puan: 0.0 (0 oy)
Mevcut
Materyal türü Geçerli Kütüphane Yer numarası Durum Notlar Barkod
Books Books Beykoz Üniversitesi Kütüphanesi T 57.85 .A38 2014 (Rafa gözat(Aşağıda açılır)) Kullanılabilir BAĞIŞLAYAN: Sabancı Üniversitesi. 00019467

Includes bibliographical references and index.

Paths, trees, and cycles -- Algorithm design and analysis -- Shortest paths : label-setting algorithms -- Shortest paths : label-correcting algorithms -- Maximum flows : basic ideas -- Maximum flows : polynomial algorithms -- Maximum flows : additional topics -- Minimum cost flows : basic algorithms -- Minimum cost flows : polynomial algorithms -- Minimum cost flows : network simplex algorithms -- Assignments and matchings -- Minimum spanning trees -- Convex cost flows -- Generalized flows -- Lagrangian relaxation and network optimization -- Multicommodity flows -- Computational testing of algorithms -- Additional applications.

Among all topics covered in operations research, network flows theory offers the best context to illustrate the basic concepts of optimization. This book provides an integrative view of the theory, algorithms and applications of network flows. In order for their presentation to be more intuitive and accessible to a wider audience, the authors prefer to adopt a network or graphical viewpoint rather than relying on a linear programming approach.

Paylaş