Flows in Networks:
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...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Princeton, NJ
Princeton University Press
[2016]
|
| Schriftenreihe: | Princeton Legacy Library
|
| Schlagworte: | |
| Online-Zugang: | URL des Erstveröffentlichers |
| Zusammenfassung: | 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 paperback editions preserve the original texts of these important books while presenting them in durable paperback 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 |
| Beschreibung: | Description based on online resource; title from PDF title page (publisher's Web site, viewed Jul. 04., 2016) |
| Beschreibung: | 1 online resource |
| ISBN: | 9781400875184 |
| DOI: | 10.1515/9781400875184 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV043712356 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 160810s2016 |||| o||u| ||||||eng d | ||
| 020 | |a 9781400875184 |9 978-1-4008-7518-4 | ||
| 024 | 7 | |a 10.1515/9781400875184 |2 doi | |
| 035 | |a (ZDB-23-DGG)9781400875184 | ||
| 035 | |a (OCoLC)927444265 | ||
| 035 | |a (DE-599)BVBBV043712356 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 082 | 0 | |a 519.72 |2 22 | |
| 100 | 1 | |a Ford, Lester Randolph |e Verfasser |4 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 [2016] | |
| 264 | 4 | |c © 1963 | |
| 300 | |a 1 online resource | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Princeton Legacy Library | |
| 500 | |a Description based on online resource; title from PDF title page (publisher's Web site, viewed Jul. 04., 2016) | ||
| 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 paperback editions preserve the original texts of these important books while presenting them in durable paperback 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 | ||
| 546 | |a In English | ||
| 650 | 4 | |a Mathematisches Modell | |
| 650 | 4 | |a Wirtschaft | |
| 650 | 4 | |a Economics |x Mathematical models | |
| 650 | 4 | |a Linear programming | |
| 650 | 0 | 7 | |a Transportproblem |0 (DE-588)4060694-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerktheorie |0 (DE-588)4171531-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Operations Research |0 (DE-588)4043586-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerkfluss |0 (DE-588)4126130-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzplantechnik |0 (DE-588)4075297-5 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Netzplantechnik |0 (DE-588)4075297-5 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 689 | 1 | 0 | |a Transportproblem |0 (DE-588)4060694-6 |D s |
| 689 | 1 | |8 2\p |5 DE-604 | |
| 689 | 2 | 0 | |a Netzwerktheorie |0 (DE-588)4171531-7 |D s |
| 689 | 2 | |8 3\p |5 DE-604 | |
| 689 | 3 | 0 | |a Operations Research |0 (DE-588)4043586-6 |D s |
| 689 | 3 | |8 4\p |5 DE-604 | |
| 689 | 4 | 0 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
| 689 | 4 | |8 5\p |5 DE-604 | |
| 689 | 5 | 0 | |a Netzwerkfluss |0 (DE-588)4126130-6 |D s |
| 689 | 5 | |8 6\p |5 DE-604 | |
| 700 | 1 | |a Fulkerson, D. R. |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1515/9781400875184 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-23-DGG | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-029124585 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 2\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 3\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 4\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 5\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
| 883 | 1 | |8 6\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804176498319425536 |
|---|---|
| any_adam_object | |
| author | Ford, Lester Randolph |
| author_facet | Ford, Lester Randolph |
| author_role | aut |
| author_sort | Ford, Lester Randolph |
| author_variant | l r f lr lrf |
| building | Verbundindex |
| bvnumber | BV043712356 |
| collection | ZDB-23-DGG |
| ctrlnum | (ZDB-23-DGG)9781400875184 (OCoLC)927444265 (DE-599)BVBBV043712356 |
| dewey-full | 519.72 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 519 - Probabilities and applied mathematics |
| dewey-raw | 519.72 |
| dewey-search | 519.72 |
| dewey-sort | 3519.72 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1515/9781400875184 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03798nmm a2200709zc 4500</leader><controlfield tag="001">BV043712356</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">160810s2016 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781400875184</subfield><subfield code="9">978-1-4008-7518-4</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">(ZDB-23-DGG)9781400875184</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)927444265</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043712356</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><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">Verfasser</subfield><subfield code="4">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">[2016]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 1963</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Princeton Legacy Library</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Description based on online resource; title from PDF title page (publisher's Web site, viewed Jul. 04., 2016)</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 paperback editions preserve the original texts of these important books while presenting them in durable paperback 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="546" ind1=" " ind2=" "><subfield code="a">In English</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematisches Modell</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wirtschaft</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Economics</subfield><subfield code="x">Mathematical models</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear programming</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Transportproblem</subfield><subfield code="0">(DE-588)4060694-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerktheorie</subfield><subfield code="0">(DE-588)4171531-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Operations Research</subfield><subfield code="0">(DE-588)4043586-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Netzplantechnik</subfield><subfield code="0">(DE-588)4075297-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Netzplantechnik</subfield><subfield code="0">(DE-588)4075297-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Transportproblem</subfield><subfield code="0">(DE-588)4060694-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="2" ind2="0"><subfield code="a">Netzwerktheorie</subfield><subfield code="0">(DE-588)4171531-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="2" ind2=" "><subfield code="8">3\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="3" ind2="0"><subfield code="a">Operations Research</subfield><subfield code="0">(DE-588)4043586-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="3" ind2=" "><subfield code="8">4\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="4" ind2="0"><subfield code="a">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="4" ind2=" "><subfield code="8">5\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="5" ind2="0"><subfield code="a">Netzwerkfluss</subfield><subfield code="0">(DE-588)4126130-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="5" ind2=" "><subfield code="8">6\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Fulkerson, D. R.</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1515/9781400875184</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-23-DGG</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-029124585</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">2\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">3\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">4\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">5\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">6\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV043712356 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T07:33:08Z |
| institution | BVB |
| isbn | 9781400875184 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-029124585 |
| oclc_num | 927444265 |
| open_access_boolean | |
| physical | 1 online resource |
| psigel | ZDB-23-DGG |
| publishDate | 2016 |
| publishDateSearch | 2016 |
| publishDateSort | 2016 |
| publisher | Princeton University Press |
| record_format | marc |
| series2 | Princeton Legacy Library |
| spelling | Ford, Lester Randolph Verfasser aut Flows in Networks D. R. Fulkerson, Lester Randolph Ford Princeton, NJ Princeton University Press [2016] © 1963 1 online resource txt rdacontent c rdamedia cr rdacarrier Princeton Legacy Library Description based on online resource; title from PDF title page (publisher's Web site, viewed Jul. 04., 2016) 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 paperback editions preserve the original texts of these important books while presenting them in durable paperback 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 In English Mathematisches Modell Wirtschaft Economics Mathematical models Linear programming Transportproblem (DE-588)4060694-6 gnd rswk-swf Netzwerk (DE-588)4171529-9 gnd rswk-swf Netzwerktheorie (DE-588)4171531-7 gnd rswk-swf Operations Research (DE-588)4043586-6 gnd rswk-swf Netzwerkfluss (DE-588)4126130-6 gnd rswk-swf Netzplantechnik (DE-588)4075297-5 gnd rswk-swf Netzplantechnik (DE-588)4075297-5 s 1\p DE-604 Transportproblem (DE-588)4060694-6 s 2\p DE-604 Netzwerktheorie (DE-588)4171531-7 s 3\p DE-604 Operations Research (DE-588)4043586-6 s 4\p DE-604 Netzwerk (DE-588)4171529-9 s 5\p DE-604 Netzwerkfluss (DE-588)4126130-6 s 6\p DE-604 Fulkerson, D. R. Sonstige oth https://doi.org/10.1515/9781400875184 Verlag URL des Erstveröffentlichers Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 2\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 3\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 4\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 5\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk 6\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Ford, Lester Randolph Flows in Networks Mathematisches Modell Wirtschaft Economics Mathematical models Linear programming Transportproblem (DE-588)4060694-6 gnd Netzwerk (DE-588)4171529-9 gnd Netzwerktheorie (DE-588)4171531-7 gnd Operations Research (DE-588)4043586-6 gnd Netzwerkfluss (DE-588)4126130-6 gnd Netzplantechnik (DE-588)4075297-5 gnd |
| subject_GND | (DE-588)4060694-6 (DE-588)4171529-9 (DE-588)4171531-7 (DE-588)4043586-6 (DE-588)4126130-6 (DE-588)4075297-5 |
| title | Flows in Networks |
| title_auth | Flows in Networks |
| title_exact_search | 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_short | Flows in Networks |
| title_sort | flows in networks |
| topic | Mathematisches Modell Wirtschaft Economics Mathematical models Linear programming Transportproblem (DE-588)4060694-6 gnd Netzwerk (DE-588)4171529-9 gnd Netzwerktheorie (DE-588)4171531-7 gnd Operations Research (DE-588)4043586-6 gnd Netzwerkfluss (DE-588)4126130-6 gnd Netzplantechnik (DE-588)4075297-5 gnd |
| topic_facet | Mathematisches Modell Wirtschaft Economics Mathematical models Linear programming Transportproblem Netzwerk Netzwerktheorie Operations Research Netzwerkfluss Netzplantechnik |
| url | https://doi.org/10.1515/9781400875184 |
| work_keys_str_mv | AT fordlesterrandolph flowsinnetworks AT fulkersondr flowsinnetworks |