Flows in Networks

Flows in Networks

EnglishPaperback / softback
Ford Lester Randolph
Princeton University Press
EAN: 9780691273433
On order
Delivery on Thursday, 6. of August 2026
CZK 945
Common price CZK 1,050
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

A landmark work that belongs on the bookshelf of every researcher working with networks

In 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.

EAN 9780691273433
ISBN 069127343X
Binding Paperback / softback
Publisher Princeton University Press
Publication date December 3, 2024
Pages 216
Language English
Dimensions 235 x 156
Country United States
Authors Ford Lester Randolph; Fulkerson D. R.
Series Princeton Landmarks in Mathematics and Physics
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.