On implementing scaling push-relabel algorithms for the minimum-cost flow problem:
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Stanford, Calif.
1992
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1418 |
| Schlagwörter: | |
| Abstract: | Abstract: "The invention of the scaling push-relabel method is an important theoretical development in the area of minimum-cost flow algorithm. In this paper we study implementations of this method. We are especially interested in heuristics that improve the performance of the algorithms in practice. Our results show that the technique works well on several problem classes with very different network structure. We also find a problem class on which the method does not perform as well and suggest directions for further improvement." |
| Umfang: | 37 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008980016 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940206s1992 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)26136488 | ||
| 035 | |a (DE-599)BVBBV008980016 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 100 | 1 | |a Goldberg, Andrew V. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a On implementing scaling push-relabel algorithms for the minimum-cost flow problem |c Andrew V. Goldberg ; Michael Kharitonov |
| 264 | 1 | |a Stanford, Calif. |c 1992 | |
| 300 | |a 37 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 1418 | |
| 520 | 3 | |a Abstract: "The invention of the scaling push-relabel method is an important theoretical development in the area of minimum-cost flow algorithm. In this paper we study implementations of this method. We are especially interested in heuristics that improve the performance of the algorithms in practice. Our results show that the technique works well on several problem classes with very different network structure. We also find a problem class on which the method does not perform as well and suggest directions for further improvement." | |
| 650 | 4 | |a Algorithms | |
| 700 | 1 | |a Kharitonov, Michael |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1418 |w (DE-604)BV008928280 |9 1418 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005930636 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6115-1418 |
|---|---|
| DE-BY-TUM_katkey | 1691529 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010282872 |
| _version_ | 1821933667026468864 |
| any_adam_object | |
| author | Goldberg, Andrew V. Kharitonov, Michael |
| author_facet | Goldberg, Andrew V. Kharitonov, Michael |
| author_role | aut aut |
| author_sort | Goldberg, Andrew V. |
| author_variant | a v g av avg m k mk |
| building | Verbundindex |
| bvnumber | BV008980016 |
| ctrlnum | (OCoLC)26136488 (DE-599)BVBBV008980016 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01555nam a2200301 cb4500</leader><controlfield tag="001">BV008980016</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940206s1992 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26136488</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008980016</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="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">On implementing scaling push-relabel algorithms for the minimum-cost flow problem</subfield><subfield code="c">Andrew V. Goldberg ; Michael Kharitonov</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1992</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">37 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">1418</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The invention of the scaling push-relabel method is an important theoretical development in the area of minimum-cost flow algorithm. In this paper we study implementations of this method. We are especially interested in heuristics that improve the performance of the algorithms in practice. Our results show that the technique works well on several problem classes with very different network structure. We also find a problem class on which the method does not perform as well and suggest directions for further improvement."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kharitonov, Michael</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">1418</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1418</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005930636</subfield></datafield></record></collection> |
| id | DE-604.BV008980016 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:29:51Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005930636 |
| oclc_num | 26136488 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 37 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spellingShingle | Goldberg, Andrew V. Kharitonov, Michael On implementing scaling push-relabel algorithms for the minimum-cost flow problem Algorithms |
| title | On implementing scaling push-relabel algorithms for the minimum-cost flow problem |
| title_auth | On implementing scaling push-relabel algorithms for the minimum-cost flow problem |
| title_exact_search | On implementing scaling push-relabel algorithms for the minimum-cost flow problem |
| title_full | On implementing scaling push-relabel algorithms for the minimum-cost flow problem Andrew V. Goldberg ; Michael Kharitonov |
| title_fullStr | On implementing scaling push-relabel algorithms for the minimum-cost flow problem Andrew V. Goldberg ; Michael Kharitonov |
| title_full_unstemmed | On implementing scaling push-relabel algorithms for the minimum-cost flow problem Andrew V. Goldberg ; Michael Kharitonov |
| title_short | On implementing scaling push-relabel algorithms for the minimum-cost flow problem |
| title_sort | on implementing scaling push relabel algorithms for the minimum cost flow problem |
| topic | Algorithms |
| topic_facet | Algorithms |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT goldbergandrewv onimplementingscalingpushrelabelalgorithmsfortheminimumcostflowproblem AT kharitonovmichael onimplementingscalingpushrelabelalgorithmsfortheminimumcostflowproblem |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6115-1418 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |