Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | German |
| Veröffentlicht: |
Wiesbaden
Dt. Univ.-Verl.
1991
|
| Schriftenreihe: | DUV : Informatik
|
| Schlagworte: | |
| Beschreibung: | Zugl.: Passau, Univ., Diss., 1991 |
| Beschreibung: | VI, 119 S. Ill. |
| ISBN: | 3824420198 |
Internformat
MARC
| LEADER | 00000nam a2200000 c 4500 | ||
|---|---|---|---|
| 001 | BV004367398 | ||
| 003 | DE-604 | ||
| 005 | 19920214 | ||
| 007 | t | ||
| 008 | 910415s1991 gw a||| m||| 00||| ger d | ||
| 020 | |a 3824420198 |9 3-8244-2019-8 | ||
| 035 | |a (OCoLC)28890443 | ||
| 035 | |a (DE-599)BVBBV004367398 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a ger | |
| 044 | |a gw |c DE | ||
| 049 | |a DE-384 |a DE-739 |a DE-706 | ||
| 050 | 0 | |a T57.85 | |
| 082 | 0 | |a 658.4/032 |2 20 | |
| 084 | |a QH 452 |0 (DE-625)141595: |2 rvk | ||
| 084 | |a SK 890 |0 (DE-625)143267: |2 rvk | ||
| 100 | 1 | |a Schannath, Heinz |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme |c Heinz Schannath |
| 264 | 1 | |a Wiesbaden |b Dt. Univ.-Verl. |c 1991 | |
| 300 | |a VI, 119 S. |b Ill. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 0 | |a DUV : Informatik | |
| 500 | |a Zugl.: Passau, Univ., Diss., 1991 | ||
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Network analysis (Planning) | |
| 650 | 0 | 7 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Transportproblem |0 (DE-588)4060694-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Netzwerkfluss |0 (DE-588)4126130-6 |2 gnd |9 rswk-swf |
| 655 | 7 | |0 (DE-588)4113937-9 |a Hochschulschrift |2 gnd-content | |
| 689 | 0 | 0 | |a Netzwerkfluss |0 (DE-588)4126130-6 |D s |
| 689 | 0 | 1 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Netzwerkfluss |0 (DE-588)4126130-6 |D s |
| 689 | 1 | 1 | |a Transportproblem |0 (DE-588)4060694-6 |D s |
| 689 | 1 | 2 | |a Polynomialzeitalgorithmus |0 (DE-588)4199652-5 |D s |
| 689 | 1 | |5 DE-604 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-002711779 | ||
Datensatz im Suchindex
| _version_ | 1804118548126105600 |
|---|---|
| any_adam_object | |
| author | Schannath, Heinz |
| author_facet | Schannath, Heinz |
| author_role | aut |
| author_sort | Schannath, Heinz |
| author_variant | h s hs |
| building | Verbundindex |
| bvnumber | BV004367398 |
| callnumber-first | T - Technology |
| callnumber-label | T57 |
| callnumber-raw | T57.85 |
| callnumber-search | T57.85 |
| callnumber-sort | T 257.85 |
| callnumber-subject | T - General Technology |
| classification_rvk | QH 452 SK 890 |
| ctrlnum | (OCoLC)28890443 (DE-599)BVBBV004367398 |
| dewey-full | 658.4/032 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.4/032 |
| dewey-search | 658.4/032 |
| dewey-sort | 3658.4 232 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Mathematik Wirtschaftswissenschaften |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01723nam a2200505 c 4500</leader><controlfield tag="001">BV004367398</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19920214 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">910415s1991 gw a||| m||| 00||| ger d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">3824420198</subfield><subfield code="9">3-8244-2019-8</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28890443</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV004367398</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">ger</subfield></datafield><datafield tag="044" ind1=" " ind2=" "><subfield code="a">gw</subfield><subfield code="c">DE</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-739</subfield><subfield code="a">DE-706</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">T57.85</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.4/032</subfield><subfield code="2">20</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">QH 452</subfield><subfield code="0">(DE-625)141595:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 890</subfield><subfield code="0">(DE-625)143267:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Schannath, Heinz</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme</subfield><subfield code="c">Heinz Schannath</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Wiesbaden</subfield><subfield code="b">Dt. Univ.-Verl.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">VI, 119 S.</subfield><subfield code="b">Ill.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">DUV : Informatik</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Zugl.: Passau, Univ., Diss., 1991</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-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="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="655" ind1=" " ind2="7"><subfield code="0">(DE-588)4113937-9</subfield><subfield code="a">Hochschulschrift</subfield><subfield code="2">gnd-content</subfield></datafield><datafield tag="689" ind1="0" 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="0" ind2="1"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" 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="1" ind2="1"><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="2"><subfield code="a">Polynomialzeitalgorithmus</subfield><subfield code="0">(DE-588)4199652-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-002711779</subfield></datafield></record></collection> |
| genre | (DE-588)4113937-9 Hochschulschrift gnd-content |
| genre_facet | Hochschulschrift |
| id | DE-604.BV004367398 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T16:12:03Z |
| institution | BVB |
| isbn | 3824420198 |
| language | German |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-002711779 |
| oclc_num | 28890443 |
| open_access_boolean | |
| owner | DE-384 DE-739 DE-706 |
| owner_facet | DE-384 DE-739 DE-706 |
| physical | VI, 119 S. Ill. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| publisher | Dt. Univ.-Verl. |
| record_format | marc |
| series2 | DUV : Informatik |
| spelling | Schannath, Heinz Verfasser aut Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme Heinz Schannath Wiesbaden Dt. Univ.-Verl. 1991 VI, 119 S. Ill. txt rdacontent n rdamedia nc rdacarrier DUV : Informatik Zugl.: Passau, Univ., Diss., 1991 Algorithms Mathematical optimization Network analysis (Planning) Polynomialzeitalgorithmus (DE-588)4199652-5 gnd rswk-swf Transportproblem (DE-588)4060694-6 gnd rswk-swf Netzwerkfluss (DE-588)4126130-6 gnd rswk-swf (DE-588)4113937-9 Hochschulschrift gnd-content Netzwerkfluss (DE-588)4126130-6 s Polynomialzeitalgorithmus (DE-588)4199652-5 s DE-604 Transportproblem (DE-588)4060694-6 s |
| spellingShingle | Schannath, Heinz Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme Algorithms Mathematical optimization Network analysis (Planning) Polynomialzeitalgorithmus (DE-588)4199652-5 gnd Transportproblem (DE-588)4060694-6 gnd Netzwerkfluss (DE-588)4126130-6 gnd |
| subject_GND | (DE-588)4199652-5 (DE-588)4060694-6 (DE-588)4126130-6 (DE-588)4113937-9 |
| title | Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme |
| title_auth | Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme |
| title_exact_search | Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme |
| title_full | Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme Heinz Schannath |
| title_fullStr | Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme Heinz Schannath |
| title_full_unstemmed | Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme Heinz Schannath |
| title_short | Polynomiale und streng polynomiale Algorithmen für Netzwerkfluss-Probleme |
| title_sort | polynomiale und streng polynomiale algorithmen fur netzwerkfluss probleme |
| topic | Algorithms Mathematical optimization Network analysis (Planning) Polynomialzeitalgorithmus (DE-588)4199652-5 gnd Transportproblem (DE-588)4060694-6 gnd Netzwerkfluss (DE-588)4126130-6 gnd |
| topic_facet | Algorithms Mathematical optimization Network analysis (Planning) Polynomialzeitalgorithmus Transportproblem Netzwerkfluss Hochschulschrift |
| work_keys_str_mv | AT schannathheinz polynomialeundstrengpolynomialealgorithmenfurnetzwerkflussprobleme |