An efficient implementation of a scaling minimum-cost flow algorithm:
Abstract: "The scaling push-relabel method is an important theoretical development in the area of minimum-cost flow algorithms. We study practical implementations of this method. We are especially interested in heuristics which improve real-life performance of the method. Our implementation wor...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Stanford, Calif.
1992
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1439 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "The scaling push-relabel method is an important theoretical development in the area of minimum-cost flow algorithms. We study practical implementations of this method. We are especially interested in heuristics which improve real-life performance of the method. Our implementation works very well over a wide range of problem classes. In our experiments, it was always competitive with the established codes, and usually outperformed these codes by a wide margin. Some heuristics we develop may apply to other network algorithms. Our experimental work on the minimum-cost flow problem motivated theoretical work on related problems." |
| Beschreibung: | 21 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009015480 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1992 |||| 00||| eng d | ||
| 035 | |a (OCoLC)28348007 | ||
| 035 | |a (DE-599)BVBBV009015480 | ||
| 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 An efficient implementation of a scaling minimum-cost flow algorithm |c by Andrew V. Goldberg |
| 264 | 1 | |a Stanford, Calif. |c 1992 | |
| 300 | |a 21 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 1439 | |
| 520 | 3 | |a Abstract: "The scaling push-relabel method is an important theoretical development in the area of minimum-cost flow algorithms. We study practical implementations of this method. We are especially interested in heuristics which improve real-life performance of the method. Our implementation works very well over a wide range of problem classes. In our experiments, it was always competitive with the established codes, and usually outperformed these codes by a wide margin. Some heuristics we develop may apply to other network algorithms. Our experimental work on the minimum-cost flow problem motivated theoretical work on related problems." | |
| 650 | 4 | |a Computer networks | |
| 650 | 4 | |a Operations research | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1439 |w (DE-604)BV008928280 |9 1439 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005961064 | ||
Datensatz im Suchindex
| _version_ | 1804123364767301632 |
|---|---|
| any_adam_object | |
| author | Goldberg, Andrew V. |
| author_facet | Goldberg, Andrew V. |
| author_role | aut |
| author_sort | Goldberg, Andrew V. |
| author_variant | a v g av avg |
| building | Verbundindex |
| bvnumber | BV009015480 |
| ctrlnum | (OCoLC)28348007 (DE-599)BVBBV009015480 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01625nam a2200301 cb4500</leader><controlfield tag="001">BV009015480</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1992 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)28348007</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009015480</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">An efficient implementation of a scaling minimum-cost flow algorithm</subfield><subfield code="c">by Andrew V. Goldberg</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">21 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">1439</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The scaling push-relabel method is an important theoretical development in the area of minimum-cost flow algorithms. We study practical implementations of this method. We are especially interested in heuristics which improve real-life performance of the method. Our implementation works very well over a wide range of problem classes. In our experiments, it was always competitive with the established codes, and usually outperformed these codes by a wide margin. Some heuristics we develop may apply to other network algorithms. Our experimental work on the minimum-cost flow problem motivated theoretical work on related problems."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer networks</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</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">1439</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1439</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005961064</subfield></datafield></record></collection> |
| id | DE-604.BV009015480 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:28:36Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005961064 |
| oclc_num | 28348007 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 21 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Goldberg, Andrew V. Verfasser aut An efficient implementation of a scaling minimum-cost flow algorithm by Andrew V. Goldberg Stanford, Calif. 1992 21 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1439 Abstract: "The scaling push-relabel method is an important theoretical development in the area of minimum-cost flow algorithms. We study practical implementations of this method. We are especially interested in heuristics which improve real-life performance of the method. Our implementation works very well over a wide range of problem classes. In our experiments, it was always competitive with the established codes, and usually outperformed these codes by a wide margin. Some heuristics we develop may apply to other network algorithms. Our experimental work on the minimum-cost flow problem motivated theoretical work on related problems." Computer networks Operations research Computer Science Department: Report STAN CS Stanford University 1439 (DE-604)BV008928280 1439 |
| spellingShingle | Goldberg, Andrew V. An efficient implementation of a scaling minimum-cost flow algorithm Computer networks Operations research |
| title | An efficient implementation of a scaling minimum-cost flow algorithm |
| title_auth | An efficient implementation of a scaling minimum-cost flow algorithm |
| title_exact_search | An efficient implementation of a scaling minimum-cost flow algorithm |
| title_full | An efficient implementation of a scaling minimum-cost flow algorithm by Andrew V. Goldberg |
| title_fullStr | An efficient implementation of a scaling minimum-cost flow algorithm by Andrew V. Goldberg |
| title_full_unstemmed | An efficient implementation of a scaling minimum-cost flow algorithm by Andrew V. Goldberg |
| title_short | An efficient implementation of a scaling minimum-cost flow algorithm |
| title_sort | an efficient implementation of a scaling minimum cost flow algorithm |
| topic | Computer networks Operations research |
| topic_facet | Computer networks Operations research |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT goldbergandrewv anefficientimplementationofascalingminimumcostflowalgorithm |