Marknadens största urval
Snabb leverans
Om Flows in Networks

A landmark work that belongs on the bookshelf of every researcher working with networksIn this classic book, first published in 1962, L. R. Ford, Jr., and D. R. Fulkerson set the foundation for the study of network flow problems. The models and algorithms introduced in Flows in Networks are used widely today in the fields of transportation systems, manufacturing, inventory planning, image processing, and Internet traffic. The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming. In addition, the book helped illuminate and unify results in combinatorial mathematics while emphasizing proofs based on computationally efficient construction. With an incisive foreword by Robert Bland and James Orlin, Flows in Networks is rich with insights that remain relevant to current research in engineering, management, and other sciences.

Visa mer
  • Språk:
  • Engelska
  • ISBN:
  • 9780691273433
  • Format:
  • Häftad
  • Sidor:
  • 216
  • Utgiven:
  • 3. december 2024
  • Mått:
  • 156x235x0 mm.
  Fri leverans
Leveranstid: 2-4 veckor
Förväntad leverans: 27. januari 2025
Förlängd ångerrätt till 31. januari 2025
  •  

    Kan ej levereras före jul.
    Köp nu och skriv ut ett presentkort

Beskrivning av Flows in Networks

A landmark work that belongs on the bookshelf of every researcher working with networksIn this classic book, first published in 1962, L. R. Ford, Jr., and D. R. Fulkerson set the foundation for the study of network flow problems. The models and algorithms introduced in Flows in Networks are used widely today in the fields of transportation systems, manufacturing, inventory planning, image processing, and Internet traffic. The techniques presented by Ford and Fulkerson spurred the development of powerful computational tools for solving and analyzing network flow models, and also furthered the understanding of linear programming. In addition, the book helped illuminate and unify results in combinatorial mathematics while emphasizing proofs based on computationally efficient construction. With an incisive foreword by Robert Bland and James Orlin, Flows in Networks is rich with insights that remain relevant to current research in engineering, management, and other sciences.

Användarnas betyg av Flows in Networks



Hitta liknande böcker
Boken Flows in Networks finns i följande kategorier:

Gör som tusentals andra bokälskare

Prenumerera på vårt nyhetsbrev för att få fantastiska erbjudanden och inspiration för din nästa läsning.