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: | |
| Beschreibung: | Print version record. - 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 |
| Beschreibung: | 1 online resource (x, 316 pages) illustrations |
| ISBN: | 9780123738509 0123738504 9780080955667 0080955665 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV045343096 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 181206s1969 |||| o||u| ||||||eng d | ||
| 020 | |a 9780123738509 |9 978-0-12-373850-9 | ||
| 020 | |a 0123738504 |9 0-12-373850-4 | ||
| 020 | |a 9780080955667 |9 978-0-08-095566-7 | ||
| 020 | |a 0080955665 |9 0-08-095566-5 | ||
| 024 | 3 | |a 9780123738509 | |
| 035 | |a (ZDB-4-ENC)ocn316573122 | ||
| 035 | |a (OCoLC)316573122 | ||
| 035 | |a (DE-599)BVBBV045343096 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 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 resource (x, 316 pages) |b illustrations | ||
| 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 Print version record. - 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 | ||
| 650 | 4 | |a Analyse de reseau (Planification) | |
| 650 | 4 | |a Programmation (Mathematiques) | |
| 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) |a Programming (Mathematics) | |
| 650 | 0 | 7 | |a Transportproblem |0 (DE-588)4060694-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerk |0 (DE-588)4171529-9 |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 | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |a Iri, Masao |t Network flow, transportation, and scheduling ; theory and algorithms |d New York : Academic Press, 1969 |
| 912 | |a ZDB-4-ENC | ||
| 999 | |a oai:aleph.bib-bvb.de:BVB01-030729800 | ||
| 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 | |
Datensatz im Suchindex
| _version_ | 1804179161511624704 |
|---|---|
| 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 | BV045343096 |
| collection | ZDB-4-ENC |
| ctrlnum | (ZDB-4-ENC)ocn316573122 (OCoLC)316573122 (DE-599)BVBBV045343096 |
| 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>02416nmm a2200565zcb4500</leader><controlfield tag="001">BV045343096</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">181206s1969 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780123738509</subfield><subfield code="9">978-0-12-373850-9</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="9">978-0-08-095566-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">0080955665</subfield><subfield code="9">0-08-095566-5</subfield></datafield><datafield tag="024" ind1="3" ind2=" "><subfield code="a">9780123738509</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-4-ENC)ocn316573122</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)316573122</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV045343096</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">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 resource (x, 316 pages)</subfield><subfield code="b">illustrations</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">Print version record. - 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="650" ind1=" " ind2="4"><subfield code="a">Analyse de reseau (Planification)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programmation (Mathematiques)</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><subfield code="a">Programming (Mathematics)</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">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">Netzwerk</subfield><subfield code="0">(DE-588)4171529-9</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="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="a">Iri, Masao</subfield><subfield code="t">Network flow, transportation, and scheduling ; theory and algorithms</subfield><subfield code="d">New York : Academic Press, 1969</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-4-ENC</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-030729800</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></record></collection> |
| id | DE-604.BV045343096 |
| illustrated | Illustrated |
| indexdate | 2024-07-10T08:15:28Z |
| institution | BVB |
| isbn | 9780123738509 0123738504 9780080955667 0080955665 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-030729800 |
| oclc_num | 316573122 |
| open_access_boolean | |
| physical | 1 online resource (x, 316 pages) illustrations |
| psigel | ZDB-4-ENC |
| 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 resource (x, 316 pages) illustrations txt rdacontent c rdamedia cr rdacarrier Mathematics in science and engineering v. 57 Print version record. - 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 Analyse de reseau (Planification) Programmation (Mathematiques) TECHNOLOGY & ENGINEERING / Engineering (General) bisacsh TECHNOLOGY & ENGINEERING / Reference bisacsh Network analysis (Planning) fast Programming (Mathematics) fast Network analysis (Planning) Programming (Mathematics) Transportproblem (DE-588)4060694-6 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Netzwerk (DE-588)4171529-9 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 Erscheint auch als Druck-Ausgabe Iri, Masao Network flow, transportation, and scheduling ; theory and algorithms New York : Academic Press, 1969 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 reseau (Planification) Programmation (Mathematiques) TECHNOLOGY & ENGINEERING / Engineering (General) bisacsh TECHNOLOGY & ENGINEERING / Reference bisacsh Network analysis (Planning) fast Programming (Mathematics) fast Network analysis (Planning) Programming (Mathematics) Transportproblem (DE-588)4060694-6 gnd Algorithmus (DE-588)4001183-5 gnd Netzwerk (DE-588)4171529-9 gnd |
| subject_GND | (DE-588)4060694-6 (DE-588)4001183-5 (DE-588)4171529-9 |
| 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 reseau (Planification) Programmation (Mathematiques) TECHNOLOGY & ENGINEERING / Engineering (General) bisacsh TECHNOLOGY & ENGINEERING / Reference bisacsh Network analysis (Planning) fast Programming (Mathematics) fast Network analysis (Planning) Programming (Mathematics) Transportproblem (DE-588)4060694-6 gnd Algorithmus (DE-588)4001183-5 gnd Netzwerk (DE-588)4171529-9 gnd |
| topic_facet | Analyse de reseau (Planification) Programmation (Mathematiques) TECHNOLOGY & ENGINEERING / Engineering (General) TECHNOLOGY & ENGINEERING / Reference Network analysis (Planning) Programming (Mathematics) Network analysis (Planning) Programming (Mathematics) Transportproblem Algorithmus Netzwerk |
| work_keys_str_mv | AT irimasao networkflowtransportationandschedulingtheoryandalgorithms |