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...
Kaydedildi:
| Diğer Yazarlar: | |
|---|---|
| Materyal Türü: | Elektronik Kitap Bölümü |
| Dil: | İngilizce |
| Baskı/Yayın Bilgisi: |
Logos Verlag Berlin
2020
|
| Konular: | |
| Online Erişim: | OAPEN Library: download the publication OAPEN Library: description of the publication |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
Internet
OAPEN Library: download the publicationOAPEN Library: description of the publication
3rd Floor Main Library
| Yer Numarası: |
A1234.567 |
|---|---|
| Kopya Bilgisi 1 | Kütüphanede |