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...
- Autores:
- Tipo de recurso:
- Book
- Fecha de publicación:
- 2020
- Institución:
- Universidad de Bogotá Jorge Tadeo Lozano
- Repositorio:
- Expeditio: repositorio UTadeo
- Idioma:
- eng
- OAI Identifier:
- oai:expeditiorepositorio.utadeo.edu.co:20.500.12010/18469
- Acceso en línea:
- https://directory.doabooks.org/handle/20.500.12854/31197
http://hdl.handle.net/20.500.12010/18469
https://doi.org/10.30819/5206
- Palabra clave:
- Mathematics
Computers
Computer Science
Lógica difusa
Matemáticas difusas
Lógica simbólica y matemática
- Rights
- License
- Abierto (Texto Completo)