Flows in Networks /

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:
Ford, Lester Randolph,
Fulkerson, D. R.,
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!
id 9781400875184
ctrlnum (DE-B1597)468158
(OCoLC)954124517
collection bib_alma
record_format marc
spelling Ford, Lester Randolph, author. aut http://id.loc.gov/vocabulary/relators/aut
Flows in Networks / D. R. Fulkerson, Lester Randolph Ford.
Princeton, NJ : Princeton University Press, [2015]
©1962
1 online resource (212 p.)
text txt rdacontent
computer c rdamedia
online resource cr rdacarrier
text file PDF rda
Princeton Legacy Library ; 54
Frontmatter -- PREFACE -- ACKNOWLEDGMENTS -- CONTENTS -- CHAPTER I. STATIC MAXIMAL FLOW -- CHAPTER II. FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS -- CHAPTER III. MINIMAL COST FLOW PROBLEMS -- CHAPTER IV. MULTI-TERMINAL MAXIMAL FLOWS -- INDEX -- Backmatter
restricted access http://purl.org/coar/access_right/c_16ec online access with authorization star
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.
Issued also in print.
Mode of access: Internet via World Wide Web.
In English.
Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)
Economics Mathematical models.
Linear programming.
MATHEMATICS / General. bisacsh
Fulkerson, D. R., author. aut http://id.loc.gov/vocabulary/relators/aut
Title is part of eBook package: De Gruyter Princeton Legacy Lib. eBook Package 1931-1979 9783110426847
Title is part of eBook package: De Gruyter Princeton Legacy Lib. eBook Package Science 9783110413595
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Archive 1927-1999 9783110442496
print 9780691625393
https://doi.org/10.1515/9781400875184
https://www.degruyter.com/isbn/9781400875184
Cover https://www.degruyter.com/cover/covers/9781400875184.jpg
language English
format eBook
author Ford, Lester Randolph,
Ford, Lester Randolph,
Fulkerson, D. R.,
spellingShingle Ford, Lester Randolph,
Ford, Lester Randolph,
Fulkerson, D. R.,
Flows in Networks /
Princeton Legacy Library ;
Frontmatter --
PREFACE --
ACKNOWLEDGMENTS --
CONTENTS --
CHAPTER I. STATIC MAXIMAL FLOW --
CHAPTER II. FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS --
CHAPTER III. MINIMAL COST FLOW PROBLEMS --
CHAPTER IV. MULTI-TERMINAL MAXIMAL FLOWS --
INDEX --
Backmatter
author_facet Ford, Lester Randolph,
Ford, Lester Randolph,
Fulkerson, D. R.,
Fulkerson, D. R.,
Fulkerson, D. R.,
author_variant l r f lr lrf
l r f lr lrf
d r f dr drf
author_role VerfasserIn
VerfasserIn
VerfasserIn
author2 Fulkerson, D. R.,
Fulkerson, D. R.,
author2_variant d r f dr drf
author2_role VerfasserIn
VerfasserIn
author_sort Ford, Lester Randolph,
title Flows in Networks /
title_full Flows in Networks / D. R. Fulkerson, Lester Randolph Ford.
title_fullStr Flows in Networks / D. R. Fulkerson, Lester Randolph Ford.
title_full_unstemmed Flows in Networks / D. R. Fulkerson, Lester Randolph Ford.
title_auth Flows in Networks /
title_alt Frontmatter --
PREFACE --
ACKNOWLEDGMENTS --
CONTENTS --
CHAPTER I. STATIC MAXIMAL FLOW --
CHAPTER II. FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS --
CHAPTER III. MINIMAL COST FLOW PROBLEMS --
CHAPTER IV. MULTI-TERMINAL MAXIMAL FLOWS --
INDEX --
Backmatter
title_new Flows in Networks /
title_sort flows in networks /
series Princeton Legacy Library ;
series2 Princeton Legacy Library ;
publisher Princeton University Press,
publishDate 2015
physical 1 online resource (212 p.)
Issued also in print.
contents Frontmatter --
PREFACE --
ACKNOWLEDGMENTS --
CONTENTS --
CHAPTER I. STATIC MAXIMAL FLOW --
CHAPTER II. FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS --
CHAPTER III. MINIMAL COST FLOW PROBLEMS --
CHAPTER IV. MULTI-TERMINAL MAXIMAL FLOWS --
INDEX --
Backmatter
isbn 9781400875184
9783110426847
9783110413595
9783110442496
9780691625393
callnumber-first Q - Science
callnumber-subject QA - Mathematics
callnumber-label QA285
callnumber-sort QA 3285 F6 41974EB
url https://doi.org/10.1515/9781400875184
https://www.degruyter.com/isbn/9781400875184
https://www.degruyter.com/cover/covers/9781400875184.jpg
illustrated Not Illustrated
dewey-hundreds 500 - Science
dewey-tens 510 - Mathematics
dewey-ones 519 - Probabilities & applied mathematics
dewey-full 519.72
dewey-sort 3519.72
dewey-raw 519.72
dewey-search 519.72
doi_str_mv 10.1515/9781400875184
oclc_num 954124517
work_keys_str_mv AT fordlesterrandolph flowsinnetworks
AT fulkersondr flowsinnetworks
status_str n
ids_txt_mv (DE-B1597)468158
(OCoLC)954124517
carrierType_str_mv cr
hierarchy_parent_title Title is part of eBook package: De Gruyter Princeton Legacy Lib. eBook Package 1931-1979
Title is part of eBook package: De Gruyter Princeton Legacy Lib. eBook Package Science
Title is part of eBook package: De Gruyter Princeton University Press eBook-Package Archive 1927-1999
is_hierarchy_title Flows in Networks /
container_title Title is part of eBook package: De Gruyter Princeton Legacy Lib. eBook Package 1931-1979
author2_original_writing_str_mv noLinkedField
noLinkedField
_version_ 1806143625877258240
fullrecord <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>04319nam a22007815i 4500</leader><controlfield tag="001">9781400875184</controlfield><controlfield tag="003">DE-B1597</controlfield><controlfield tag="005">20210830012106.0</controlfield><controlfield tag="006">m|||||o||d||||||||</controlfield><controlfield tag="007">cr || ||||||||</controlfield><controlfield tag="008">210830t20151962nju fo d z eng d</controlfield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)1054881509</subfield></datafield><datafield tag="019" ind1=" " ind2=" "><subfield code="a">(OCoLC)973400412</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400875184</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1515/9781400875184</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-B1597)468158</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)954124517</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-B1597</subfield><subfield code="b">eng</subfield><subfield code="c">DE-B1597</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">nju</subfield><subfield code="c">US-NJ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA285</subfield><subfield code="b">.F6 1974eb</subfield></datafield><datafield tag="072" ind1=" " ind2="7"><subfield code="a">MAT000000</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">519.72</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ford, Lester Randolph, </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Flows in Networks /</subfield><subfield code="c">D. R. Fulkerson, Lester Randolph Ford.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Princeton, NJ : </subfield><subfield code="b">Princeton University Press, </subfield><subfield code="c">[2015]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©1962</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (212 p.)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="347" ind1=" " ind2=" "><subfield code="a">text file</subfield><subfield code="b">PDF</subfield><subfield code="2">rda</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Princeton Legacy Library ;</subfield><subfield code="v">54</subfield></datafield><datafield tag="505" ind1="0" ind2="0"><subfield code="t">Frontmatter -- </subfield><subfield code="t">PREFACE -- </subfield><subfield code="t">ACKNOWLEDGMENTS -- </subfield><subfield code="t">CONTENTS -- </subfield><subfield code="t">CHAPTER I. STATIC MAXIMAL FLOW -- </subfield><subfield code="t">CHAPTER II. FEASIBILITY THEOREMS AND COMBINATORIAL APPLICATIONS -- </subfield><subfield code="t">CHAPTER III. MINIMAL COST FLOW PROBLEMS -- </subfield><subfield code="t">CHAPTER IV. MULTI-TERMINAL MAXIMAL FLOWS -- </subfield><subfield code="t">INDEX -- </subfield><subfield code="t">Backmatter</subfield></datafield><datafield tag="506" ind1="0" ind2=" "><subfield code="a">restricted access</subfield><subfield code="u">http://purl.org/coar/access_right/c_16ec</subfield><subfield code="f">online access with authorization</subfield><subfield code="2">star</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="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.</subfield></datafield><datafield tag="530" ind1=" " ind2=" "><subfield code="a">Issued also in print.</subfield></datafield><datafield tag="538" ind1=" " ind2=" "><subfield code="a">Mode of access: Internet via World Wide Web.</subfield></datafield><datafield tag="546" ind1=" " ind2=" "><subfield code="a">In English.</subfield></datafield><datafield tag="588" ind1="0" ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed 30. Aug 2021)</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Economics</subfield><subfield code="x">Mathematical models.</subfield></datafield><datafield tag="650" ind1=" " ind2="0"><subfield code="a">Linear programming.</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">MATHEMATICS / General.</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fulkerson, D. R., </subfield><subfield code="e">author.</subfield><subfield code="4">aut</subfield><subfield code="4">http://id.loc.gov/vocabulary/relators/aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton Legacy Lib. eBook Package 1931-1979</subfield><subfield code="z">9783110426847</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton Legacy Lib. eBook Package Science</subfield><subfield code="z">9783110413595</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Title is part of eBook package:</subfield><subfield code="d">De Gruyter</subfield><subfield code="t">Princeton University Press eBook-Package Archive 1927-1999</subfield><subfield code="z">9783110442496</subfield></datafield><datafield tag="776" ind1="0" ind2=" "><subfield code="c">print</subfield><subfield code="z">9780691625393</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400875184</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.degruyter.com/isbn/9781400875184</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="3">Cover</subfield><subfield code="u">https://www.degruyter.com/cover/covers/9781400875184.jpg</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-041359-5 Princeton Legacy Lib. eBook Package Science</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-042684-7 Princeton Legacy Lib. eBook Package 1931-1979</subfield><subfield code="c">1931</subfield><subfield code="d">1979</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">978-3-11-044249-6 Princeton University Press eBook-Package Archive 1927-1999</subfield><subfield code="c">1927</subfield><subfield code="d">1999</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_BACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_CL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBACKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ECL_MTPY</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_EEBKALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_ESTMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_PPALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">EBA_STMALL</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV-deGruyter-alles</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA12STME</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA13ENGE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA18STMEE</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">PDA5EBK</subfield></datafield></record></collection>

Similar Items