| 書目名稱 | Polytopes - Combinations and Computation | | 編輯 | Gil Kalai,Günter M. Ziegler | | 視頻video | http://file.papertrans.cn/752/751427/751427.mp4 | | 叢書名稱 | Oberwolfach Seminars | | 圖書封面 |  | | 描述 | Questions that arose from linear programming and combinatorial optimization have been a driving force for modern polytope theory, such as the diameter questions motivated by the desire to understand the complexity of the simplex algorithm, or the need to study facets for use in cutting plane procedures. In addition, algorithms now provide the means to computationally study polytopes, to compute their parameters such as flag vectors, graphs and volumes, and to construct examples of large complexity. The papers of this volume thus display a wide panorama of connections of polytope theory with other fields. Areas such as discrete and computational geometry, linear and combinatorial optimization, and scientific computing have contributed a combination of questions, ideas, results, algorithms and, finally, computer programs. | | 出版日期 | Book 2000 | | 關(guān)鍵詞 | Diskrete Mathematik; Geometrie; Optimisierung; addition; boundary element method; combinatorial optimizat | | 版次 | 1 | | doi | https://doi.org/10.1007/978-3-0348-8438-9 | | isbn_softcover | 978-3-7643-6351-2 | | isbn_ebook | 978-3-0348-8438-9Series ISSN 1661-237X Series E-ISSN 2296-5041 | | issn_series | 1661-237X | | copyright | Springer Basel AG 2000 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-6 14:22
發(fā)表于 2025-3-21 16:17:31
