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...
| Autor principal: | |
|---|---|
| Formato: | Libro |
| Publicado: |
Logos Verlag Berlin
2020
|
| Acceso en línea: | Ver este registro en EBSCOhost |