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...
保存先:
第一著者: | |
---|---|
フォーマット: | 電子媒体 図書の章 |
言語: | 英語 |
出版事項: |
Berlin/Germany
Logos Verlag Berlin
2020
|
主題: | |
オンライン・アクセス: | DOAB: download the publication DOAB: description of the publication |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|
このレコードへの初めてのコメントを付けませんか!