An efficient cost scaling algorithm for the assignment problem:
Abstract: "The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow problems. In this paper we apply the method to the assignment problem. We investigate implementations of the method that take advantage of the problem structure. The results show that th...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Stanford, Calif.
1993
|
| Series: | Stanford University / Computer Science Department: Report STAN CS
1481 |
| Subjects: | |
| Summary: | Abstract: "The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow problems. In this paper we apply the method to the assignment problem. We investigate implementations of the method that take advantage of the problem structure. The results show that the method is very promising for practical use; it outperforms all other codes in almost all problems in our study." |
| Physical Description: | 24 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009041467 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940227s1993 |||| 00||| eng d | ||
| 035 | |a (OCoLC)30464398 | ||
| 035 | |a (DE-599)BVBBV009041467 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Goldberg, Andrew V. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a An efficient cost scaling algorithm for the assignment problem |c Andrew V. Goldberg and Robert Kennedy |
| 264 | 1 | |a Stanford, Calif. |c 1993 | |
| 300 | |a 24 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 1481 | |
| 520 | 3 | |a Abstract: "The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow problems. In this paper we apply the method to the assignment problem. We investigate implementations of the method that take advantage of the problem structure. The results show that the method is very promising for practical use; it outperforms all other codes in almost all problems in our study." | |
| 650 | 4 | |a Computer algorithms | |
| 650 | 4 | |a Network analysis (Planning) | |
| 700 | 1 | |a Kennedy, Robert |e Verfasser |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1481 |w (DE-604)BV008928280 |9 1481 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005982791 | ||
Record in the Search Index
| _version_ | 1804123396257087488 |
|---|---|
| any_adam_object | |
| author | Goldberg, Andrew V. Kennedy, Robert |
| author_facet | Goldberg, Andrew V. Kennedy, Robert |
| author_role | aut aut |
| author_sort | Goldberg, Andrew V. |
| author_variant | a v g av avg r k rk |
| building | Verbundindex |
| bvnumber | BV009041467 |
| ctrlnum | (OCoLC)30464398 (DE-599)BVBBV009041467 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01450nam a2200313 cb4500</leader><controlfield tag="001">BV009041467</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940227s1993 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)30464398</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009041467</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></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 cost scaling algorithm for the assignment problem</subfield><subfield code="c">Andrew V. Goldberg and Robert Kennedy</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">24 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">1481</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow problems. In this paper we apply the method to the assignment problem. We investigate implementations of the method that take advantage of the problem structure. The results show that the method is very promising for practical use; it outperforms all other codes in almost all problems in our study."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Network analysis (Planning)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kennedy, Robert</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">1481</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1481</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005982791</subfield></datafield></record></collection> |
| id | DE-604.BV009041467 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:29:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005982791 |
| oclc_num | 30464398 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 24 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spelling | Goldberg, Andrew V. Verfasser aut An efficient cost scaling algorithm for the assignment problem Andrew V. Goldberg and Robert Kennedy Stanford, Calif. 1993 24 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN CS 1481 Abstract: "The cost scaling push-relabel method has been shown to be efficient for solving minimum-cost flow problems. In this paper we apply the method to the assignment problem. We investigate implementations of the method that take advantage of the problem structure. The results show that the method is very promising for practical use; it outperforms all other codes in almost all problems in our study." Computer algorithms Network analysis (Planning) Kennedy, Robert Verfasser aut Computer Science Department: Report STAN CS Stanford University 1481 (DE-604)BV008928280 1481 |
| spellingShingle | Goldberg, Andrew V. Kennedy, Robert An efficient cost scaling algorithm for the assignment problem Computer algorithms Network analysis (Planning) |
| title | An efficient cost scaling algorithm for the assignment problem |
| title_auth | An efficient cost scaling algorithm for the assignment problem |
| title_exact_search | An efficient cost scaling algorithm for the assignment problem |
| title_full | An efficient cost scaling algorithm for the assignment problem Andrew V. Goldberg and Robert Kennedy |
| title_fullStr | An efficient cost scaling algorithm for the assignment problem Andrew V. Goldberg and Robert Kennedy |
| title_full_unstemmed | An efficient cost scaling algorithm for the assignment problem Andrew V. Goldberg and Robert Kennedy |
| title_short | An efficient cost scaling algorithm for the assignment problem |
| title_sort | an efficient cost scaling algorithm for the assignment problem |
| topic | Computer algorithms Network analysis (Planning) |
| topic_facet | Computer algorithms Network analysis (Planning) |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT goldbergandrewv anefficientcostscalingalgorithmfortheassignmentproblem AT kennedyrobert anefficientcostscalingalgorithmfortheassignmentproblem |