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...
Збережено в:
| Інші автори: | |
|---|---|
| Формат: | Електронний ресурс Частина з книги |
| Мова: | Англійська |
| Опубліковано: |
Logos Verlag Berlin
2020
|
| Предмети: | |
| Онлайн доступ: | OAPEN Library: download the publication OAPEN Library: description of the publication |
| Теги: |
Додати тег
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|
Інтернет
OAPEN Library: download the publicationOAPEN Library: description of the publication
3rd Floor Main Library
| Шифр: |
A1234.567 |
|---|---|
| Примірник 1 | Доступно |