Network flow, transportation, and scheduling: theory and algorithms
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Elektronisch E-Book |
Sprache: | English |
Veröffentlicht: |
New York
Academic Press
1969
|
Schriftenreihe: | Mathematics in science and engineering
v. 57 |
Schlagworte: | |
Online-Zugang: | FAW01 FAW02 Volltext |
Beschreibung: | Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002 Includes bibliographical references (p. 307-309) 1. Introduction -- 2. Convex sets and functions -- 3. Topological properties of networks -- 4. Network-flow problems in general -- 5. Linear network-flow problems |
Beschreibung: | 1 Online-Ressource (x, 316 p.) |
ISBN: | 0080955665 0123738504 9780080955667 9780123738509 |
Internformat
MARC
LEADER | 00000nmm a2200000zcb4500 | ||
---|---|---|---|
001 | BV043045050 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | cr|uuu---uuuuu | ||
008 | 151123s1969 |||| o||u| ||||||eng d | ||
020 | |a 0080955665 |c electronic bk. |9 0-08-095566-5 | ||
020 | |a 0123738504 |9 0-12-373850-4 | ||
020 | |a 9780080955667 |c electronic bk. |9 978-0-08-095566-7 | ||
020 | |a 9780123738509 |9 978-0-12-373850-9 | ||
035 | |a (OCoLC)316573122 | ||
035 | |a (DE-599)BVBBV043045050 | ||
040 | |a DE-604 |b ger |e aacr | ||
041 | 0 | |a eng | |
049 | |a DE-1046 |a DE-1047 | ||
082 | 0 | |a 620 |2 22 | |
100 | 1 | |a Iri, Masao |e Verfasser |4 aut | |
245 | 1 | 0 | |a Network flow, transportation, and scheduling |b theory and algorithms |c Masao Iri |
264 | 1 | |a New York |b Academic Press |c 1969 | |
300 | |a 1 Online-Ressource (x, 316 p.) | ||
336 | |b txt |2 rdacontent | ||
337 | |b c |2 rdamedia | ||
338 | |b cr |2 rdacarrier | ||
490 | 0 | |a Mathematics in science and engineering |v v. 57 | |
500 | |a Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002 | ||
500 | |a Includes bibliographical references (p. 307-309) | ||
500 | |a 1. Introduction -- 2. Convex sets and functions -- 3. Topological properties of networks -- 4. Network-flow problems in general -- 5. Linear network-flow problems | ||
650 | 4 | |a Analyse de réseau (Planification) | |
650 | 4 | |a Programmation (Mathématiques) | |
650 | 7 | |a TECHNOLOGY & ENGINEERING / Engineering (General) |2 bisacsh | |
650 | 7 | |a TECHNOLOGY & ENGINEERING / Reference |2 bisacsh | |
650 | 7 | |a Network analysis (Planning) |2 fast | |
650 | 7 | |a Programming (Mathematics) |2 fast | |
650 | 4 | |a Network analysis (Planning) | |
650 | 4 | |a Programming (Mathematics) | |
650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Transportproblem |0 (DE-588)4060694-6 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Transportproblem |0 (DE-588)4060694-6 |D s |
689 | 0 | 1 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | |8 1\p |5 DE-604 | |
689 | 1 | 0 | |a Netzwerk |0 (DE-588)4171529-9 |D s |
689 | 1 | |8 2\p |5 DE-604 | |
856 | 4 | 0 | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408057 |x Aggregator |3 Volltext |
912 | |a ZDB-4-EBA | ||
999 | |a oai:aleph.bib-bvb.de:BVB01-028469588 | ||
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 | |
966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408057 |l FAW01 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext | |
966 | e | |u http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408057 |l FAW02 |p ZDB-4-EBA |q FAW_PDA_EBA |x Aggregator |3 Volltext |
Datensatz im Suchindex
_version_ | 1804175411513393152 |
---|---|
any_adam_object | |
author | Iri, Masao |
author_facet | Iri, Masao |
author_role | aut |
author_sort | Iri, Masao |
author_variant | m i mi |
building | Verbundindex |
bvnumber | BV043045050 |
collection | ZDB-4-EBA |
ctrlnum | (OCoLC)316573122 (DE-599)BVBBV043045050 |
dewey-full | 620 |
dewey-hundreds | 600 - Technology (Applied sciences) |
dewey-ones | 620 - Engineering and allied operations |
dewey-raw | 620 |
dewey-search | 620 |
dewey-sort | 3620 |
dewey-tens | 620 - Engineering and allied operations |
format | Electronic eBook |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02913nmm a2200613zcb4500</leader><controlfield tag="001">BV043045050</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">151123s1969 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0080955665</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">0-08-095566-5</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0123738504</subfield><subfield code="9">0-12-373850-4</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780080955667</subfield><subfield code="c">electronic bk.</subfield><subfield code="9">978-0-08-095566-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780123738509</subfield><subfield code="9">978-0-12-373850-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)316573122</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV043045050</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-1046</subfield><subfield code="a">DE-1047</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">620</subfield><subfield code="2">22</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Iri, Masao</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Network flow, transportation, and scheduling</subfield><subfield code="b">theory and algorithms</subfield><subfield code="c">Masao Iri</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York</subfield><subfield code="b">Academic Press</subfield><subfield code="c">1969</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (x, 316 p.)</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">Mathematics in science and engineering</subfield><subfield code="v">v. 57</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Includes bibliographical references (p. 307-309)</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">1. Introduction -- 2. Convex sets and functions -- 3. Topological properties of networks -- 4. Network-flow problems in general -- 5. Linear network-flow problems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Analyse de réseau (Planification)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Mathématiques)</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">TECHNOLOGY & ENGINEERING / Engineering (General)</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">TECHNOLOGY & ENGINEERING / Reference</subfield><subfield code="2">bisacsh</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Network analysis (Planning)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="7"><subfield code="a">Programming (Mathematics)</subfield><subfield code="2">fast</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming (Mathematics)</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">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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="689" ind1="0" 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="0" ind2="1"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-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">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</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="856" ind1="4" ind2="0"><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408057</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-EBA</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-028469588</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="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408057</subfield><subfield code="l">FAW01</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408057</subfield><subfield code="l">FAW02</subfield><subfield code="p">ZDB-4-EBA</subfield><subfield code="q">FAW_PDA_EBA</subfield><subfield code="x">Aggregator</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
id | DE-604.BV043045050 |
illustrated | Not Illustrated |
indexdate | 2024-07-10T07:15:52Z |
institution | BVB |
isbn | 0080955665 0123738504 9780080955667 9780123738509 |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-028469588 |
oclc_num | 316573122 |
open_access_boolean | |
owner | DE-1046 DE-1047 |
owner_facet | DE-1046 DE-1047 |
physical | 1 Online-Ressource (x, 316 p.) |
psigel | ZDB-4-EBA ZDB-4-EBA FAW_PDA_EBA |
publishDate | 1969 |
publishDateSearch | 1969 |
publishDateSort | 1969 |
publisher | Academic Press |
record_format | marc |
series2 | Mathematics in science and engineering |
spelling | Iri, Masao Verfasser aut Network flow, transportation, and scheduling theory and algorithms Masao Iri New York Academic Press 1969 1 Online-Ressource (x, 316 p.) txt rdacontent c rdamedia cr rdacarrier Mathematics in science and engineering v. 57 Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002 Includes bibliographical references (p. 307-309) 1. Introduction -- 2. Convex sets and functions -- 3. Topological properties of networks -- 4. Network-flow problems in general -- 5. Linear network-flow problems Analyse de réseau (Planification) Programmation (Mathématiques) TECHNOLOGY & ENGINEERING / Engineering (General) bisacsh TECHNOLOGY & ENGINEERING / Reference bisacsh Network analysis (Planning) fast Programming (Mathematics) fast Network analysis (Planning) Programming (Mathematics) Netzwerk (DE-588)4171529-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Transportproblem (DE-588)4060694-6 gnd rswk-swf Transportproblem (DE-588)4060694-6 s Algorithmus (DE-588)4001183-5 s 1\p DE-604 Netzwerk (DE-588)4171529-9 s 2\p DE-604 http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408057 Aggregator 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 |
spellingShingle | Iri, Masao Network flow, transportation, and scheduling theory and algorithms Analyse de réseau (Planification) Programmation (Mathématiques) TECHNOLOGY & ENGINEERING / Engineering (General) bisacsh TECHNOLOGY & ENGINEERING / Reference bisacsh Network analysis (Planning) fast Programming (Mathematics) fast Network analysis (Planning) Programming (Mathematics) Netzwerk (DE-588)4171529-9 gnd Algorithmus (DE-588)4001183-5 gnd Transportproblem (DE-588)4060694-6 gnd |
subject_GND | (DE-588)4171529-9 (DE-588)4001183-5 (DE-588)4060694-6 |
title | Network flow, transportation, and scheduling theory and algorithms |
title_auth | Network flow, transportation, and scheduling theory and algorithms |
title_exact_search | Network flow, transportation, and scheduling theory and algorithms |
title_full | Network flow, transportation, and scheduling theory and algorithms Masao Iri |
title_fullStr | Network flow, transportation, and scheduling theory and algorithms Masao Iri |
title_full_unstemmed | Network flow, transportation, and scheduling theory and algorithms Masao Iri |
title_short | Network flow, transportation, and scheduling |
title_sort | network flow transportation and scheduling theory and algorithms |
title_sub | theory and algorithms |
topic | Analyse de réseau (Planification) Programmation (Mathématiques) TECHNOLOGY & ENGINEERING / Engineering (General) bisacsh TECHNOLOGY & ENGINEERING / Reference bisacsh Network analysis (Planning) fast Programming (Mathematics) fast Network analysis (Planning) Programming (Mathematics) Netzwerk (DE-588)4171529-9 gnd Algorithmus (DE-588)4001183-5 gnd Transportproblem (DE-588)4060694-6 gnd |
topic_facet | Analyse de réseau (Planification) Programmation (Mathématiques) TECHNOLOGY & ENGINEERING / Engineering (General) TECHNOLOGY & ENGINEERING / Reference Network analysis (Planning) Programming (Mathematics) Netzwerk Algorithmus Transportproblem |
url | http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=408057 |
work_keys_str_mv | AT irimasao networkflowtransportationandschedulingtheoryandalgorithms |