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

Полное описание

Библиографические подробности

Главный автор:	Vincent Hopp, Alexander
Формат:	Online
Язык:	английский
Опубликовано:	Logos Verlag Berlin 2021
Предметы:	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
Online-ссылка:	ONIX_20210408_9783832552060_84
Метки:	Добавить метку Нет меток, Требуется 1-ая метка записи!