D. R. Fulkerson – författare

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.

This book presents simple, elegant methods for dealing, both in theory and in application, with a variety of problems that have formulations in terms of flows in capacity-constrained networks. Since the theoretical considerations lead in all cases to computationally efficient solution procedures, the hook provides a common meeting ground for persons interested in operations research, industrial and communications engineering, or combinatorial mathematics. Originally published in 1962. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

This book presents simple, elegant methods for dealing, both in theory and in application, with a variety of problems that have formulations in terms of flows in capacity-constrained networks. Since the theoretical considerations lead in all cases to computationally efficient solution procedures, the hook provides a common meeting ground for persons interested in operations research, industrial and communications engineering, or combinatorial mathematics.Originally published in 1962.The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.