Newton's method for fractional combinatorial optimization:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Stanford, Calif.
1992
|
| Schriftenreihe: | Stanford University / Computer Science Department: Report STAN CS
1406 |
| Schlagwörter: | |
| Abstract: | Abstract: "We consider Newton's method for the linear fractional combinatorial optimization. First we show a strongly polynomial bound on the number of iterations for the general case. Then we consider the transshipment problem when the maximum arc cost is being minimized. This problem can be reduced to the maximum mean-weight cut problem, which is a special case of the linear fractional combinatorial optimization. We prove that Newton's method runs in O(m) iterations for the maximum mean-weight cut problem. One iteration is dominated by the maximum flow computation, so the overall running time is Õ(m²n). The previous fastest algorithm is based on Meggido's parametric search method and runs in Õ(n³m) time." |
| Umfang: | 20 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008993180 | ||
| 003 | DE-604 | ||
| 005 | 19961015 | ||
| 007 | t| | ||
| 008 | 940206s1992 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)27036483 | ||
| 035 | |a (DE-599)BVBBV008993180 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 050 | 0 | |a QA297.8 | |
| 082 | 0 | |a 511/.6 |2 20 | |
| 100 | 1 | |a Radzik, Tomasz |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Newton's method for fractional combinatorial optimization |c by Thomas Radzik |
| 264 | 1 | |a Stanford, Calif. |c 1992 | |
| 300 | |a 20 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 1406 | |
| 520 | 3 | |a Abstract: "We consider Newton's method for the linear fractional combinatorial optimization. First we show a strongly polynomial bound on the number of iterations for the general case. Then we consider the transshipment problem when the maximum arc cost is being minimized. This problem can be reduced to the maximum mean-weight cut problem, which is a special case of the linear fractional combinatorial optimization. We prove that Newton's method runs in O(m) iterations for the maximum mean-weight cut problem. One iteration is dominated by the maximum flow computation, so the overall running time is Õ(m²n). The previous fastest algorithm is based on Meggido's parametric search method and runs in Õ(n³m) time." | |
| 650 | 4 | |a Datenverarbeitung | |
| 650 | 4 | |a Combinatorial optimization |x Data processing | |
| 650 | 4 | |a Newton-Raphson method |x Data processing | |
| 810 | 2 | |a Computer Science Department: Report STAN CS |t Stanford University |v 1406 |w (DE-604)BV008928280 |9 1406 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-005942003 | |
Datensatz im Suchindex
| DE-BY-TUM_call_number | 0111 2001 B 6115-1406 |
|---|---|
| DE-BY-TUM_katkey | 1691537 |
| DE-BY-TUM_location | 01 |
| DE-BY-TUM_media_number | 040010282792 |
| _version_ | 1821933664290734080 |
| any_adam_object | |
| author | Radzik, Tomasz |
| author_facet | Radzik, Tomasz |
| author_role | aut |
| author_sort | Radzik, Tomasz |
| author_variant | t r tr |
| building | Verbundindex |
| bvnumber | BV008993180 |
| callnumber-first | Q - Science |
| callnumber-label | QA297 |
| callnumber-raw | QA297.8 |
| callnumber-search | QA297.8 |
| callnumber-sort | QA 3297.8 |
| callnumber-subject | QA - Mathematics |
| ctrlnum | (OCoLC)27036483 (DE-599)BVBBV008993180 |
| dewey-full | 511/.6 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.6 |
| dewey-search | 511/.6 |
| dewey-sort | 3511 16 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01807nam a2200337 cb4500</leader><controlfield tag="001">BV008993180</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">19961015 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940206s1992 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27036483</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993180</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">QA297.8</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.6</subfield><subfield code="2">20</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Radzik, Tomasz</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Newton's method for fractional combinatorial optimization</subfield><subfield code="c">by Thomas Radzik</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">20 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">1406</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We consider Newton's method for the linear fractional combinatorial optimization. First we show a strongly polynomial bound on the number of iterations for the general case. Then we consider the transshipment problem when the maximum arc cost is being minimized. This problem can be reduced to the maximum mean-weight cut problem, which is a special case of the linear fractional combinatorial optimization. We prove that Newton's method runs in O(m) iterations for the maximum mean-weight cut problem. One iteration is dominated by the maximum flow computation, so the overall running time is Õ(m²n). The previous fastest algorithm is based on Meggido's parametric search method and runs in Õ(n³m) time."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Datenverarbeitung</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Combinatorial optimization</subfield><subfield code="x">Data processing</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Newton-Raphson method</subfield><subfield code="x">Data processing</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">1406</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1406</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005942003</subfield></datafield></record></collection> |
| id | DE-604.BV008993180 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:30:06Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005942003 |
| oclc_num | 27036483 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 20 S. |
| publishDate | 1992 |
| publishDateSearch | 1992 |
| publishDateSort | 1992 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN CS |
| spellingShingle | Radzik, Tomasz Newton's method for fractional combinatorial optimization Datenverarbeitung Combinatorial optimization Data processing Newton-Raphson method Data processing |
| title | Newton's method for fractional combinatorial optimization |
| title_auth | Newton's method for fractional combinatorial optimization |
| title_exact_search | Newton's method for fractional combinatorial optimization |
| title_full | Newton's method for fractional combinatorial optimization by Thomas Radzik |
| title_fullStr | Newton's method for fractional combinatorial optimization by Thomas Radzik |
| title_full_unstemmed | Newton's method for fractional combinatorial optimization by Thomas Radzik |
| title_short | Newton's method for fractional combinatorial optimization |
| title_sort | newton s method for fractional combinatorial optimization |
| topic | Datenverarbeitung Combinatorial optimization Data processing Newton-Raphson method Data processing |
| topic_facet | Datenverarbeitung Combinatorial optimization Data processing Newton-Raphson method Data processing |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT radziktomasz newtonsmethodforfractionalcombinatorialoptimization |
Paper/Kapitel scannen lassen
Teilbibliothek Mathematik & Informatik, Berichte
| Signatur: |
0111 2001 B 6115-1406 Lageplan |
|---|---|
| Exemplar 1 | Ausleihbar Am Standort |