Flows in Networks / / D. R. Fulkerson, Lester Randolph Ford.

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, th...

Full description

Saved in:
Bibliographic Details
Superior document:Title is part of eBook package: De Gruyter Princeton Legacy Lib. eBook Package 1931-1979
VerfasserIn:
Place / Publishing House:Princeton, NJ : : Princeton University Press, , [2015]
©1962
Year of Publication:2015
Language:English
Series:Princeton Legacy Library ; 54
Online Access:
Physical Description:1 online resource (212 p.)
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 04319nam a22007815i 4500
001 9781400875184
003 DE-B1597
005 20210830012106.0
006 m|||||o||d||||||||
007 cr || ||||||||
008 210830t20151962nju fo d z eng d
019 |a (OCoLC)1054881509 
019 |a (OCoLC)973400412 
020 |a 9781400875184 
024 7 |a 10.1515/9781400875184  |2 doi 
035 |a (DE-B1597)468158 
035 |a (OCoLC)954124517 
040 |a DE-B1597  |b eng  |c DE-B1597  |e rda 
041 0 |a eng 
044 |a nju  |c US-NJ 
050 4 |a QA285  |b .F6 1974eb 
072 7 |a MAT000000  |2 bisacsh 
082 0 4 |a 519.72  |2 22 
100 1 |a Ford, Lester Randolph,   |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Flows in Networks /  |c D. R. Fulkerson, Lester Randolph Ford. 
264 1 |a Princeton, NJ :   |b Princeton University Press,   |c [2015] 
264 4 |c ©1962 
300 |a 1 online resource (212 p.) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 0 |a Princeton Legacy Library ;  |v 54 
505 0 0 |t Frontmatter --   |t PREFACE --   |t ACKNOWLEDGMENTS --   |t CONTENTS --   |t CHAPTER I. STATIC MAXIMAL FLOW --   |t CHAPTER II. FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS --   |t CHAPTER III. MINIMAL COST FLOW PROBLEMS --   |t CHAPTER IV. MULTI-TERMINAL MAXIMAL FLOWS --   |t INDEX --   |t Backmatter 
506 0 |a restricted access  |u http://purl.org/coar/access_right/c_16ec  |f online access with authorization  |2 star 
520 |a 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. 
530 |a Issued also in print. 
538 |a Mode of access: Internet via World Wide Web. 
546 |a In English. 
588 0 |a Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021) 
650 0 |a Economics  |x Mathematical models. 
650 0 |a Linear programming. 
650 7 |a MATHEMATICS / General.  |2 bisacsh 
700 1 |a Fulkerson, D. R.,   |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
773 0 8 |i Title is part of eBook package:  |d De Gruyter  |t Princeton Legacy Lib. eBook Package 1931-1979  |z 9783110426847 
773 0 8 |i Title is part of eBook package:  |d De Gruyter  |t Princeton Legacy Lib. eBook Package Science  |z 9783110413595 
773 0 8 |i Title is part of eBook package:  |d De Gruyter  |t Princeton University Press eBook-Package Archive 1927-1999  |z 9783110442496 
776 0 |c print  |z 9780691625393 
856 4 0 |u https://doi.org/10.1515/9781400875184 
856 4 0 |u https://www.degruyter.com/isbn/9781400875184 
856 4 2 |3 Cover  |u https://www.degruyter.com/cover/covers/9781400875184.jpg 
912 |a 978-3-11-041359-5 Princeton Legacy Lib. eBook Package Science 
912 |a 978-3-11-042684-7 Princeton Legacy Lib. eBook Package 1931-1979  |c 1931  |d 1979 
912 |a 978-3-11-044249-6 Princeton University Press eBook-Package Archive 1927-1999  |c 1927  |d 1999 
912 |a EBA_BACKALL 
912 |a EBA_CL_MTPY 
912 |a EBA_EBACKALL 
912 |a EBA_EBKALL 
912 |a EBA_ECL_MTPY 
912 |a EBA_EEBKALL 
912 |a EBA_ESTMALL 
912 |a EBA_PPALL 
912 |a EBA_STMALL 
912 |a GBV-deGruyter-alles 
912 |a PDA12STME 
912 |a PDA13ENGE 
912 |a PDA18STMEE 
912 |a PDA5EBK