The ellipsoid method: a survey
IN February 1979 a note by L.G. Khachiyan indicated how an ellipsoid method for linear programming can be implemented in polynomial time. This result has caused great excitement and stimulated a flood of technical papers. Ordinarily there would be no need for a survey of work so recent. The current...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Ithaca, NY
1980
|
| Schriftenreihe: | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report
441 |
| Schlagworte: | |
| Zusammenfassung: | IN February 1979 a note by L.G. Khachiyan indicated how an ellipsoid method for linear programming can be implemented in polynomial time. This result has caused great excitement and stimulated a flood of technical papers. Ordinarily there would be no need for a survey of work so recent. The current circumstances are obviously exceptional. Word of Khachiyan's result has spread extraordinarily fast, much faster than comprehension of its significance. A variety of issues have in general not been well understood, including the exact character of the ellipsoid method and of Khachiyan's result on polynomiality, its practical significance in linear programming, its implementation, its potential applicability to problems outside of the domain of linear programming, and its relationship to earlier work. Our aim here is to help clarify these important issues in the context of a survey of the ellipsoid method, its historical antecedents, recent developments, and current research. |
| Beschreibung: | 80 Sp. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010010503 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 950127s1980 d||| |||| 00||| engod | ||
| 035 | |a (OCoLC)63578958 | ||
| 035 | |a (DE-599)BVBBV010010503 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Bland, Robert G. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a The ellipsoid method |b a survey |c Robert G. Bland ; Donald Goldfarb ; Michael J. Todd |
| 264 | 1 | |a Ithaca, NY |c 1980 | |
| 300 | |a 80 Sp. |b graph. Darst. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |v 441 | |
| 520 | 3 | |a IN February 1979 a note by L.G. Khachiyan indicated how an ellipsoid method for linear programming can be implemented in polynomial time. This result has caused great excitement and stimulated a flood of technical papers. Ordinarily there would be no need for a survey of work so recent. The current circumstances are obviously exceptional. Word of Khachiyan's result has spread extraordinarily fast, much faster than comprehension of its significance. A variety of issues have in general not been well understood, including the exact character of the ellipsoid method and of Khachiyan's result on polynomiality, its practical significance in linear programming, its implementation, its potential applicability to problems outside of the domain of linear programming, and its relationship to earlier work. Our aim here is to help clarify these important issues in the context of a survey of the ellipsoid method, its historical antecedents, recent developments, and current research. | |
| 650 | 4 | |a Computational complexity | |
| 650 | 4 | |a Linear programming | |
| 700 | 1 | |a Goldfarb, Donald |e Verfasser |4 aut | |
| 700 | 1 | |a Todd, Michael J. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Technical report |t Cornell University <Ithaca, NY> |v 441 |w (DE-604)BV006185504 |9 441 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006637413 | ||
Datensatz im Suchindex
| _version_ | 1804124389998854144 |
|---|---|
| any_adam_object | |
| author | Bland, Robert G. Goldfarb, Donald Todd, Michael J. |
| author_facet | Bland, Robert G. Goldfarb, Donald Todd, Michael J. |
| author_role | aut aut aut |
| author_sort | Bland, Robert G. |
| author_variant | r g b rg rgb d g dg m j t mj mjt |
| building | Verbundindex |
| bvnumber | BV010010503 |
| ctrlnum | (OCoLC)63578958 (DE-599)BVBBV010010503 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02090nam a2200325 cb4500</leader><controlfield tag="001">BV010010503</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950127s1980 d||| |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)63578958</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010010503</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-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Bland, Robert G.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">The ellipsoid method</subfield><subfield code="b">a survey</subfield><subfield code="c">Robert G. Bland ; Donald Goldfarb ; Michael J. Todd</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Ithaca, NY</subfield><subfield code="c">1980</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">80 Sp.</subfield><subfield code="b">graph. Darst.</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">Cornell University <Ithaca, NY> / Department of Computer Science: Technical report</subfield><subfield code="v">441</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">IN February 1979 a note by L.G. Khachiyan indicated how an ellipsoid method for linear programming can be implemented in polynomial time. This result has caused great excitement and stimulated a flood of technical papers. Ordinarily there would be no need for a survey of work so recent. The current circumstances are obviously exceptional. Word of Khachiyan's result has spread extraordinarily fast, much faster than comprehension of its significance. A variety of issues have in general not been well understood, including the exact character of the ellipsoid method and of Khachiyan's result on polynomiality, its practical significance in linear programming, its implementation, its potential applicability to problems outside of the domain of linear programming, and its relationship to earlier work. Our aim here is to help clarify these important issues in the context of a survey of the ellipsoid method, its historical antecedents, recent developments, and current research.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computational complexity</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Linear programming</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Goldfarb, Donald</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Todd, Michael J.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Technical report</subfield><subfield code="t">Cornell University <Ithaca, NY></subfield><subfield code="v">441</subfield><subfield code="w">(DE-604)BV006185504</subfield><subfield code="9">441</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006637413</subfield></datafield></record></collection> |
| id | DE-604.BV010010503 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:44:54Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006637413 |
| oclc_num | 63578958 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 80 Sp. graph. Darst. |
| publishDate | 1980 |
| publishDateSearch | 1980 |
| publishDateSort | 1980 |
| record_format | marc |
| series2 | Cornell University <Ithaca, NY> / Department of Computer Science: Technical report |
| spelling | Bland, Robert G. Verfasser aut The ellipsoid method a survey Robert G. Bland ; Donald Goldfarb ; Michael J. Todd Ithaca, NY 1980 80 Sp. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Cornell University <Ithaca, NY> / Department of Computer Science: Technical report 441 IN February 1979 a note by L.G. Khachiyan indicated how an ellipsoid method for linear programming can be implemented in polynomial time. This result has caused great excitement and stimulated a flood of technical papers. Ordinarily there would be no need for a survey of work so recent. The current circumstances are obviously exceptional. Word of Khachiyan's result has spread extraordinarily fast, much faster than comprehension of its significance. A variety of issues have in general not been well understood, including the exact character of the ellipsoid method and of Khachiyan's result on polynomiality, its practical significance in linear programming, its implementation, its potential applicability to problems outside of the domain of linear programming, and its relationship to earlier work. Our aim here is to help clarify these important issues in the context of a survey of the ellipsoid method, its historical antecedents, recent developments, and current research. Computational complexity Linear programming Goldfarb, Donald Verfasser aut Todd, Michael J. Verfasser aut Department of Computer Science: Technical report Cornell University <Ithaca, NY> 441 (DE-604)BV006185504 441 |
| spellingShingle | Bland, Robert G. Goldfarb, Donald Todd, Michael J. The ellipsoid method a survey Computational complexity Linear programming |
| title | The ellipsoid method a survey |
| title_auth | The ellipsoid method a survey |
| title_exact_search | The ellipsoid method a survey |
| title_full | The ellipsoid method a survey Robert G. Bland ; Donald Goldfarb ; Michael J. Todd |
| title_fullStr | The ellipsoid method a survey Robert G. Bland ; Donald Goldfarb ; Michael J. Todd |
| title_full_unstemmed | The ellipsoid method a survey Robert G. Bland ; Donald Goldfarb ; Michael J. Todd |
| title_short | The ellipsoid method |
| title_sort | the ellipsoid method a survey |
| title_sub | a survey |
| topic | Computational complexity Linear programming |
| topic_facet | Computational complexity Linear programming |
| volume_link | (DE-604)BV006185504 |
| work_keys_str_mv | AT blandrobertg theellipsoidmethodasurvey AT goldfarbdonald theellipsoidmethodasurvey AT toddmichaelj theellipsoidmethodasurvey |