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

Descrizione completa

Dettagli Bibliografici

Autore principale:	Vincent Hopp, Alexander
Natura:	Online
Lingua:	inglese
Pubblicazione:	Logos Verlag Berlin 2021
Soggetti:	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
Accesso online:	ONIX_20210408_9783832552060_84
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!