Network Flows: Theory, Algorithms, and Applications - Rilegato

Ahuja, Ravindra K.; Magnanti, T. L.; Orlin, James B.

 
9780136175490: Network Flows: Theory, Algorithms, and Applications
Rilegato
ISBN 10: 013617549X ISBN 13: 9780136175490
Casa editrice: Pearson College Div, 1993

Sinossi

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.    

    Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

    Editore
    Pearson College Div
    Data di pubblicazione
    1993
    Lingua
    Inglese
    ISBN 10 
    013617549X
    ISBN 13 
    9780136175490
    Rilegatura
    Copertina rigida
    Numero edizione
    1
    Numero di pagine
    864
    Contatto del produttore
    non disponibile
    Persona responsabile
    Riccardo Bacigalupo
    riccardo.bacigalupo@sanoma.it

    Sanoma Italia Via Arconati, 1 �
    Milano
    20135
    Italia

    Altre edizioni note dello stesso titolo

    9789332535152: Network Flows: Theory, Algorithms, and Applications

    Edizione in evidenza

    ISBN 10:  9332535159 ISBN 13:  9789332535152
    Casa editrice: Pearson Education India, 2017
    Brossura