| 書目名稱 | Handbook of Combinatorial Optimization | | 副標題 | Supplement Volume A | | 編輯 | Ding-Zhu Du,Panos M. Pardalos | | 視頻video | http://file.papertrans.cn/422/421051/421051.mp4 | | 圖書封面 |  | | 描述 | Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied math- ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, air- line crew scheduling, corporate planning, computer-aided design and man- ufacturing, database query design, cellular telephone frequency assignment, constraint directed reasoning, and computational biology. Furthermore, combinatorial optimization problems occur in many diverse areas such as linear and integer programming, graph theory, artificial intelligence, and number theory. All these problems, when formulated mathematically as the minimization or maximization of a certain function defined on some domain, have a commonality of discreteness. Historically, combinatorial optimization starts with linear programming. Linear programming has an entire range of important applications including production planning and distribution, personnel assignment, finance, alloca- tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the | | 出版日期 | Book 1999 | | 關(guān)鍵詞 | Analysis; algorithms; combinatorial optimization; linear optimization; optimization; combinatorics; inform | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4757-3023-4 | | isbn_softcover | 978-1-4419-4813-7 | | isbn_ebook | 978-1-4757-3023-4 | | copyright | Springer-Verlag US 1999 |
The information of publication is updating
|
|
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-10 00:55
發(fā)表于 2025-3-21 16:20:16
