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...
Saved in:
| Other Authors: | |
|---|---|
| Format: | Electronic Book Chapter |
| Language: | English |
| Published: |
Logos Verlag Berlin
2020
|
| Subjects: | |
| Online Access: | DOAB: download the publication DOAB: description of the publication |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Search Result 1
OAPEN Library: description of the publication
The Complexity of Zadeh's Pivot Rule
Published 2020
OAPEN Library: download the publication
OAPEN Library: description of the publication
Electronic
Book Chapter