Efficiency of the network simplex algorithm for the maximum flow problem:
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1989
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN-CS
1248 |
| Schlagworte: | |
| Beschreibung: | 17 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009246200 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)20257481 | ||
| 035 | |a (DE-599)BVBBV009246200 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 050 | 0 | |a QA76 | |
| 100 | 1 | |a Goldberg, Andrew V. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Efficiency of the network simplex algorithm for the maximum flow problem |c by Andrew V. Goldberg, Michael D. Grigoriadis, and Robert E. Tarjan |
| 264 | 1 | |a Stanford, Calif. |c 1989 | |
| 300 | |a 17 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Stanford University / Computer Science Department: Report STAN-CS |v 1248 | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Computer networks | |
| 650 | 4 | |a Data structures (Computer science) | |
| 650 | 4 | |a Linear programming | |
| 700 | 1 | |a Grigoriadis, Michael D. |e Verfasser |4 aut | |
| 700 | 1 | |a Tarjan, Robert E. |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1248 |w (DE-604)BV008928280 |9 1248 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006152486 | ||
Datensatz im Suchindex
| _version_ | 1804123693482246144 |
|---|---|
| any_adam_object | |
| author | Goldberg, Andrew V. Grigoriadis, Michael D. Tarjan, Robert E. |
| author_facet | Goldberg, Andrew V. Grigoriadis, Michael D. Tarjan, Robert E. |
| author_role | aut aut aut |
| author_sort | Goldberg, Andrew V. |
| author_variant | a v g av avg m d g md mdg r e t re ret |
| building | Verbundindex |
| bvnumber | BV009246200 |
| callnumber-first | Q - Science |
| callnumber-label | QA76 |
| callnumber-raw | QA76 |
| callnumber-search | QA76 |
| callnumber-sort | QA 276 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)20257481 (DE-599)BVBBV009246200 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01255nam a2200361 cb4500</leader><controlfield tag="001">BV009246200</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)20257481</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009246200</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">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-29T</subfield><subfield code="a">DE-91G</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">QA76</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Goldberg, Andrew V.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Efficiency of the network simplex algorithm for the maximum flow problem</subfield><subfield code="c">by Andrew V. Goldberg, Michael D. Grigoriadis, and Robert E. Tarjan</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">17 S.</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="1" ind2=" "><subfield code="a">Stanford University / Computer Science Department: Report STAN-CS</subfield><subfield code="v">1248</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Data structures (Computer science)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Grigoriadis, Michael D.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tarjan, Robert E.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Computer Science Department: Report STAN-CS</subfield><subfield code="t">Stanford University</subfield><subfield code="v">1248</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1248</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006152486</subfield></datafield></record></collection> |
| id | DE-604.BV009246200 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:33:50Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006152486 |
| oclc_num | 20257481 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 17 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Goldberg, Andrew V. Verfasser aut Efficiency of the network simplex algorithm for the maximum flow problem by Andrew V. Goldberg, Michael D. Grigoriadis, and Robert E. Tarjan Stanford, Calif. 1989 17 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1248 Algorithms Computational complexity Computer networks Data structures (Computer science) Linear programming Grigoriadis, Michael D. Verfasser aut Tarjan, Robert E. Verfasser aut Computer Science Department: Report STAN-CS Stanford University 1248 (DE-604)BV008928280 1248 |
| spellingShingle | Goldberg, Andrew V. Grigoriadis, Michael D. Tarjan, Robert E. Efficiency of the network simplex algorithm for the maximum flow problem Algorithms Computational complexity Computer networks Data structures (Computer science) Linear programming |
| title | Efficiency of the network simplex algorithm for the maximum flow problem |
| title_auth | Efficiency of the network simplex algorithm for the maximum flow problem |
| title_exact_search | Efficiency of the network simplex algorithm for the maximum flow problem |
| title_full | Efficiency of the network simplex algorithm for the maximum flow problem by Andrew V. Goldberg, Michael D. Grigoriadis, and Robert E. Tarjan |
| title_fullStr | Efficiency of the network simplex algorithm for the maximum flow problem by Andrew V. Goldberg, Michael D. Grigoriadis, and Robert E. Tarjan |
| title_full_unstemmed | Efficiency of the network simplex algorithm for the maximum flow problem by Andrew V. Goldberg, Michael D. Grigoriadis, and Robert E. Tarjan |
| title_short | Efficiency of the network simplex algorithm for the maximum flow problem |
| title_sort | efficiency of the network simplex algorithm for the maximum flow problem |
| topic | Algorithms Computational complexity Computer networks Data structures (Computer science) Linear programming |
| topic_facet | Algorithms Computational complexity Computer networks Data structures (Computer science) Linear programming |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT goldbergandrewv efficiencyofthenetworksimplexalgorithmforthemaximumflowproblem AT grigoriadismichaeld efficiencyofthenetworksimplexalgorithmforthemaximumflowproblem AT tarjanroberte efficiencyofthenetworksimplexalgorithmforthemaximumflowproblem |