Polynomial dual network simplex algorithms:
Abstract: "We show how to use polynomial and strongly polynomial capacity scaling algorithms for the transshipment problem to design a polynomial dual network simplex pivot rule. Our best pivoting strategy leads to an O(m²log n) bound on the number of pivots, where n and m denotes the number of...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Stanford, Calif.
1991
|
| Series: | Stanford University / Computer Science Department: Report STAN-CS
1374 |
| Subjects: | |
| Summary: | Abstract: "We show how to use polynomial and strongly polynomial capacity scaling algorithms for the transshipment problem to design a polynomial dual network simplex pivot rule. Our best pivoting strategy leads to an O(m²log n) bound on the number of pivots, where n and m denotes the number of nodes and arcs in the input network. If the demands are integral and at most B, we also give an O(m(m+n log n)min(log nB, mlog n))- time implementation of a strategy that requires somewhat more pivots." |
| Physical Description: | 23 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008979486 | ||
| 003 | DE-604 | ||
| 005 | 20160613 | ||
| 007 | t | ||
| 008 | 940206s1991 |||| 00||| eng d | ||
| 035 | |a (OCoLC)27771590 | ||
| 035 | |a (DE-599)BVBBV008979486 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T |a DE-91G | ||
| 050 | 0 | |a T57.85 | |
| 082 | 0 | |a 658.4/032 |2 20 | |
| 100 | 1 | |a Orlin, James B. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Polynomial dual network simplex algorithms |c James B. Orlin ; Serge A. Plotkin ; Eva Tardos |
| 264 | 1 | |a Stanford, Calif. |c 1991 | |
| 300 | |a 23 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 1374 | |
| 520 | 3 | |a Abstract: "We show how to use polynomial and strongly polynomial capacity scaling algorithms for the transshipment problem to design a polynomial dual network simplex pivot rule. Our best pivoting strategy leads to an O(m²log n) bound on the number of pivots, where n and m denotes the number of nodes and arcs in the input network. If the demands are integral and at most B, we also give an O(m(m+n log n)min(log nB, mlog n))- time implementation of a strategy that requires somewhat more pivots." | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Mathematical optimization | |
| 650 | 4 | |a Network analysis (Planning) | |
| 700 | 1 | |a Plotkin, Serge A. |e Verfasser |4 aut | |
| 700 | 1 | |a Tardos, Éva |d 1957- |e Verfasser |0 (DE-588)140445382 |4 aut | |
| 810 | 2 | |a Computer Science Department: Report STAN-CS |t Stanford University |v 1374 |w (DE-604)BV008928280 |9 1374 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005930193 | ||
Record in the Search Index
| _version_ | 1804123318223110144 |
|---|---|
| any_adam_object | |
| author | Orlin, James B. Plotkin, Serge A. Tardos, Éva 1957- |
| author_GND | (DE-588)140445382 |
| author_facet | Orlin, James B. Plotkin, Serge A. Tardos, Éva 1957- |
| author_role | aut aut aut |
| author_sort | Orlin, James B. |
| author_variant | j b o jb jbo s a p sa sap é t ét |
| building | Verbundindex |
| bvnumber | BV008979486 |
| callnumber-first | T - Technology |
| callnumber-label | T57 |
| callnumber-raw | T57.85 |
| callnumber-search | T57.85 |
| callnumber-sort | T 257.85 |
| callnumber-subject | T - General Technology |
| ctrlnum | (OCoLC)27771590 (DE-599)BVBBV008979486 |
| dewey-full | 658.4/032 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.4/032 |
| dewey-search | 658.4/032 |
| dewey-sort | 3658.4 232 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Wirtschaftswissenschaften |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01688nam a2200361 cb4500</leader><controlfield tag="001">BV008979486</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20160613 </controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)27771590</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008979486</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">T57.85</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.4/032</subfield><subfield code="2">20</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Orlin, James B.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Polynomial dual network simplex algorithms</subfield><subfield code="c">James B. Orlin ; Serge A. Plotkin ; Eva Tardos</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">23 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">1374</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "We show how to use polynomial and strongly polynomial capacity scaling algorithms for the transshipment problem to design a polynomial dual network simplex pivot rule. Our best pivoting strategy leads to an O(m²log n) bound on the number of pivots, where n and m denotes the number of nodes and arcs in the input network. If the demands are integral and at most B, we also give an O(m(m+n log n)min(log nB, mlog n))- time implementation of a strategy that requires somewhat more pivots."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical optimization</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">Plotkin, Serge A.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Tardos, Éva</subfield><subfield code="d">1957-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)140445382</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">1374</subfield><subfield code="w">(DE-604)BV008928280</subfield><subfield code="9">1374</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005930193</subfield></datafield></record></collection> |
| id | DE-604.BV008979486 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:52Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005930193 |
| oclc_num | 27771590 |
| open_access_boolean | |
| owner | DE-29T DE-91G DE-BY-TUM |
| owner_facet | DE-29T DE-91G DE-BY-TUM |
| physical | 23 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Stanford University / Computer Science Department: Report STAN-CS |
| spelling | Orlin, James B. Verfasser aut Polynomial dual network simplex algorithms James B. Orlin ; Serge A. Plotkin ; Eva Tardos Stanford, Calif. 1991 23 S. txt rdacontent n rdamedia nc rdacarrier Stanford University / Computer Science Department: Report STAN-CS 1374 Abstract: "We show how to use polynomial and strongly polynomial capacity scaling algorithms for the transshipment problem to design a polynomial dual network simplex pivot rule. Our best pivoting strategy leads to an O(m²log n) bound on the number of pivots, where n and m denotes the number of nodes and arcs in the input network. If the demands are integral and at most B, we also give an O(m(m+n log n)min(log nB, mlog n))- time implementation of a strategy that requires somewhat more pivots." Algorithms Mathematical optimization Network analysis (Planning) Plotkin, Serge A. Verfasser aut Tardos, Éva 1957- Verfasser (DE-588)140445382 aut Computer Science Department: Report STAN-CS Stanford University 1374 (DE-604)BV008928280 1374 |
| spellingShingle | Orlin, James B. Plotkin, Serge A. Tardos, Éva 1957- Polynomial dual network simplex algorithms Algorithms Mathematical optimization Network analysis (Planning) |
| title | Polynomial dual network simplex algorithms |
| title_auth | Polynomial dual network simplex algorithms |
| title_exact_search | Polynomial dual network simplex algorithms |
| title_full | Polynomial dual network simplex algorithms James B. Orlin ; Serge A. Plotkin ; Eva Tardos |
| title_fullStr | Polynomial dual network simplex algorithms James B. Orlin ; Serge A. Plotkin ; Eva Tardos |
| title_full_unstemmed | Polynomial dual network simplex algorithms James B. Orlin ; Serge A. Plotkin ; Eva Tardos |
| title_short | Polynomial dual network simplex algorithms |
| title_sort | polynomial dual network simplex algorithms |
| topic | Algorithms Mathematical optimization Network analysis (Planning) |
| topic_facet | Algorithms Mathematical optimization Network analysis (Planning) |
| volume_link | (DE-604)BV008928280 |
| work_keys_str_mv | AT orlinjamesb polynomialdualnetworksimplexalgorithms AT plotkinsergea polynomialdualnetworksimplexalgorithms AT tardoseva polynomialdualnetworksimplexalgorithms |