The Complexity of Zadeh's Pivot Rule
The Simplex algorithm is one of the most important algorithms in discrete optimization, and is the most used algorithm for solving linear programs in practice. In the last 50 years, several pivot rules for this algorithm have been proposed and studied. For most deterministic pivot rules, exponential...
Gorde:
| Beste egile batzuk: | |
|---|---|
| Formatua: | Baliabide elektronikoa Liburu kapitulua |
| Hizkuntza: | ingelesa |
| Argitaratua: |
Logos Verlag Berlin
2020
|
| Gaiak: | |
| Sarrera elektronikoa: | DOAB: download the publication DOAB: description of the publication |
| Etiketak: |
Etiketa erantsi
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|