| 書目名稱 | Optimization with Disjunctive Constraints | | 編輯 | Hanif D. Sherali,C. M. Shetty | | 視頻video | http://file.papertrans.cn/704/703309/703309.mp4 | | 叢書名稱 | Lecture Notes in Economics and Mathematical Systems | | 圖書封面 |  | | 描述 | The disjunctive cut principle of Balas and Jeroslow, and the related polyhedral annexation principle of Glover, provide new insights into cutting plane theory. This has resulted in its ability to not only subsume many known valid cuts but also improve upon them. Originally a set of notes were written for the purpose of putting together in a common terminology and framework significant results of Glover and others using a geometric approach, referred to in the literature as convexity cuts, and the algebraic approach of Balas and Jeroslow known as Disjunctive cuts. As it turned out subsequently the polyhedral annexation approach of Glover is also closely connected with the basic disjunctive principle of Balas and Jeroslow. In this monograph we have included these results and have also added several published results which seem to be of strong interest to researchers in the area of developing strong cuts for disjunctive programs. In particular, several results due to Balas [4,5,6,7], Glover [18,19] and Jeroslow [23,25,26] have been used in this monograph. The appropriate theorems are given without proof. The notes also include several results yet to be published [32,34,35] obtained un | | 出版日期 | Book 1980 | | 關(guān)鍵詞 | Disjunktive Optimierung; algorithms; linear optimization; optimization; scheduling | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-642-48794-1 | | isbn_softcover | 978-3-540-10228-1 | | isbn_ebook | 978-3-642-48794-1Series ISSN 0075-8442 Series E-ISSN 2196-9957 | | issn_series | 0075-8442 | | copyright | Springer-Verlag Berlin Heidelberg 1980 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-10 19:22
發(fā)表于 2025-3-21 18:22:36
