| 书目名称 | The Quadratic Assignment Problem | | 副标题 | Theory and Algorithm | | 编辑 | Eranda Çela | | 视频video | | | 丛书名称 | Combinatorial Optimization | | 图书封面 |  | | 描述 | The quadratic assignment problem (QAP) was introduced in 1957 by Koopmans and Beckmann to model a plant location problem. Since then the QAP has been object of numerous investigations by mathematicians, computers scientists, ope- tions researchers and practitioners. Nowadays the QAP is widely considered as a classical combinatorial optimization problem which is (still) attractive from many points of view. In our opinion there are at last three main reasons which make the QAP a popular problem in combinatorial optimization. First, the number of re- life problems which are mathematically modeled by QAPs has been continuously increasing and the variety of the fields they belong to is astonishing. To recall just a restricted number among the applications of the QAP let us mention placement problems, scheduling, manufacturing, VLSI design, statistical data analysis, and parallel and distributed computing. Secondly, a number of other well known c- binatorial optimization problems can be formulated as QAPs. Typical examples are the traveling salesman problem and a large number of optimization problems in graphs such as the maximum clique problem, the graph partitioning problem and the min | | 出版日期 | Book 1998 | | 关键词 | Approximation; Facility Location; Notation; STATISTICA; algorithms; combinatorial optimization; complexity | | 版次 | 1 | | doi | https://doi.org/10.1007/978-1-4757-2787-6 | | isbn_softcover | 978-1-4419-4786-4 | | isbn_ebook | 978-1-4757-2787-6Series ISSN 1388-3011 | | issn_series | 1388-3011 | | copyright | Springer Science+Business Media Dordrecht 1998 |
The information of publication is updating
|
|
发表于 2025-3-21 19:08:03
