Network flows : theory, algorithms, and applications

Başlık:

Yazar:

Ahuja, Ravindra K., 1956-

ISBN:

9780136175490

Ek Yazar:

Ahuja, Ravindra K., 1956-

Yayım Bilgisi:

Englewood Cliffs, N.J. : Prentice Hall, c1993.

Fiziksel Tanım:

xv, 846 s. : şkl. ; 25 cm.

Contents:

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.

Yollar, ağaç yapılar ve dönüşüm - Algoritma tasarım ve analiz - Kısa yolları: etiket-algoritmaları ayarları - En kısa yolları: etiket-algoritmaları düzeltmeler - Maksimum akımları: temel fikirleri - Maksimum akımları: polinom algoritmaları - Maksimum akımları: ek konular - Minimum maliyet akışı: temel algoritmaları - Minimum maliyet akışı: polinom algoritmaları - Minimum maliyet akışı: ağ simpleks algoritmaları - Atama ve eşleştirmeler - ağaç yapılarda asgari kapsama - Konveks maliyet akışları - Genelleştirilmiş akışlar - Lagrange gevşeme ve ağ optimizasyonu - Çoklu hammadde akışı - algoritmaların hesaplamalı testleri - Ek uygulamalar.

Konu Terimleri:

Şebeke analizi (Planlama).

Network analysis (Planning)

Matematiksel optimizasyon.

Mathematical optimization.

Added Author:

Magnanti, Thomas L.

Orlin, James B., 1953-

Mevcut:*

Library	Materyal Türü	Barkod	Yer Numarası	Durum
Searching... Pamukkale Merkez Kütüphanesi	Kitap	0017436	T57.85.A37 1993	Searching... Unknown
Searching... Pamukkale Merkez Kütüphanesi	Kitap	0093257	T57.85.A37 1993	Searching... Unknown

Bound With These Titles

On Order

Özet

A comprehensive introduction to network flows that brings together the classic and the contemporary aspects of the field, and provides an integrative view of theory, algorithms, and applications.

presents in-depth, self-contained treatments of shortest path, maximum flow, and minimum cost flow problems, including descriptions of polynomial-time algorithms for these core models. emphasizes powerful algorithmic strategies and analysis tools such as data scaling, geometric improvement arguments, and potential function arguments. provides an easy-to-understand descriptions of several important data structures, including d-heaps, Fibonacci heaps, and dynamic trees. devotes a special chapter to conducting empirical testing of algorithms. features over 150 applications of network flows to a variety of engineering, management, and scientific domains. contains extensive reference notes and illustrations.

1 Introduction

2 Paths, Trees and Cycles

3 Algorithm Design and Analysis

4 Shortest Paths: Label Setting Algorithms

5 Shortest Paths: Label Correcting Algorithms

6 Maximum Flows: Basic Ideas

7 Maximum Flows: Polynomial Algorithms

8 Maximum Flows: Additional Topics

9 Minimum Cost Flows: Basic Algorithms

10 Minimum Cost Flows: Polynomial Algorithms

11 Minimum Cost Flows: Network Simplex Algorithms

12 Assignments and Matchings

13 Minimum Spanning Trees

14 Convex Cost Flows

15 Generalized Flows

16 Lagrangian Relaxation and Network Optimization

17 Multicommodity Flows

18 Computational Testing of Algorithms

19 Additional Applications

Appendix A Data Structures

Appendix B NP-Completeness

Appendix C Linear Programming

Index

Mevcut:*

Bound With These Titles

On Order

Özet

Özet

Table of Contents