| 书目名称 | Handbook of Combinatorial Optimization | | 副标题 | Supplement Volume B | | 编辑 | Ding-Zhu Du,Panos M. Pardalos | | 视频video | | | 概述 | The material presented in this supplement to the 3-volume Handbook of Combinatorial Optimization will be useful for any researcher who uses combinatorial optimization methods to solve problems.Include | | 图书封面 |  | | 描述 | Combinatorial (or discrete) optimization is one of the most active fields in the interface of operations research, computer science, and applied ma- ematics. Combinatorial optimization problems arise in various applications, including communications network design, VLSI design, machine vision, a- line crew scheduling, corporate planning, computer-aided design and m- 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, allo- tion of economic resources, circuit simulation, and control systems. Leonid Kantorovich and Tjalling Koopmans received the Nobel P | | 出版日期 | Book 2005 | | 关键词 | Partition; algorithm; algorithms; combinatorial optimization; data mining; model; network; networks; optimiz | | 版次 | 1 | | doi | https://doi.org/10.1007/b102533 | | isbn_softcover | 978-1-4419-3666-0 | | isbn_ebook | 978-0-387-23830-2 | | copyright | Springer-Verlag US 2005 |
The information of publication is updating
|
|
发表于 2025-3-21 17:48:43
