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...

ver descrição completa

Detalhes bibliográficos

Autor principal:	Vincent Hopp, Alexander
Formato:	Online
Idioma:	inglês
Publicado em:	Logos Verlag Berlin 2021
Assuntos:	Optimierung, Optimization Komplexität, Complexity Lineare Programmierung, Linear programming Simplexalgorithmus, Simplex algorithm Pivotregel, Pvot rule thema EDItEUR::P Mathematics and Science::PB Mathematics::PBT Probability and statistics
Acesso em linha:	ONIX_20210408_9783832552060_84
Tags:	Adicionar Tag Sem tags, seja o primeiro a adicionar uma tag!