The Quadratic Assignment Problem
Title | The Quadratic Assignment Problem PDF eBook |
Author | E. Cela |
Publisher | Springer Science & Business Media |
Pages | 296 |
Release | 2013-03-14 |
Genre | Mathematics |
ISBN | 1475727879 |
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 minimum feedback arc set problem. Finally, from a computational point of view the QAP is a very difficult problem. The QAP is not only NP-hard and - hard to approximate, but it is also practically intractable: it is generally considered as impossible to solve (to optimality) QAP instances of size larger than 20 within reasonable time limits.
The Quadratic Assignment Problem
Title | The Quadratic Assignment Problem PDF eBook |
Author | E. Cela |
Publisher | Springer |
Pages | 287 |
Release | 1997-12-31 |
Genre | Mathematics |
ISBN | 9780792348788 |
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 minimum feedback arc set problem. Finally, from a computational point of view the QAP is a very difficult problem. The QAP is not only NP-hard and - hard to approximate, but it is also practically intractable: it is generally considered as impossible to solve (to optimality) QAP instances of size larger than 20 within reasonable time limits.
Handbook of Combinatorial Optimization
Title | Handbook of Combinatorial Optimization PDF eBook |
Author | Ding-Zhu Du |
Publisher | Springer Science & Business Media |
Pages | 395 |
Release | 2006-08-18 |
Genre | Business & Economics |
ISBN | 0387238301 |
This is a supplementary volume to the major three-volume Handbook of Combinatorial Optimization set. It can also be regarded as a stand-alone volume presenting chapters dealing with various aspects of the subject in a self-contained way.
Quadratic Assignment and Related Problems
Title | Quadratic Assignment and Related Problems PDF eBook |
Author | Panos M. Pardalos |
Publisher | American Mathematical Soc. |
Pages | 380 |
Release | 1994-01-01 |
Genre | Mathematics |
ISBN | 9780821870624 |
The methods described here include eigenvalue estimates and reduction techniques for lower bounds, parallelization, genetic algorithms, polyhedral approaches, greedy and adaptive search algorithms.
Assignment Problems, Revised Reprint
Title | Assignment Problems, Revised Reprint PDF eBook |
Author | Rainer Burkard |
Publisher | SIAM |
Pages | 403 |
Release | 2012-10-31 |
Genre | Mathematics |
ISBN | 1611972221 |
Assignment Problems is a useful tool for researchers, practitioners and graduate students. In 10 self-contained chapters, it provides a comprehensive treatment of assignment problems from their conceptual beginnings through present-day theoretical, algorithmic and practical developments. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems and many variations of these. Researchers will benefit from the detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its variations. Practitioners will learn about practical applications of the methods, the performance of exact and heuristic algorithms, and software options. This book also can serve as a text for advanced courses in areas related to discrete mathematics and combinatorial optimisation. The revised reprint provides details on a recent discovery related to one of Jacobi's results, new material on inverse assignment problems and quadratic assignment problems, and an updated bibliography.
Facility Layout
Title | Facility Layout PDF eBook |
Author | Miguel F. Anjos |
Publisher | Springer Nature |
Pages | 121 |
Release | 2021-04-24 |
Genre | Business & Economics |
ISBN | 3030709906 |
This book presents a structured approach to develop mathematical optimization formulations for several variants of facility layout. The range of layout problems covered includes row layouts, floor layouts, multi-floor layouts, and dynamic layouts. The optimization techniques used to formulate the problems are primarily mixed-integer linear programming, second-order conic programming, and semidefinite programming. The book also covers important practical considerations for solving the formulations. The breadth of approaches presented help the reader to learn how to formulate a variety of problems using mathematical optimization techniques. The book also illustrates the use of layout formulations in selected engineering applications, including manufacturing, building design, automotive, and hospital layout.
Proceedings of 6th International Conference on Harmony Search, Soft Computing and Applications
Title | Proceedings of 6th International Conference on Harmony Search, Soft Computing and Applications PDF eBook |
Author | Sinan Melih Nigdeli |
Publisher | Springer Nature |
Pages | 438 |
Release | 2020-11-16 |
Genre | Technology & Engineering |
ISBN | 9811586039 |
This book covers different aspects of real-world applications of optimization algorithms. It provides insights from the Sixth International Conference on Harmony Search, Soft Computing and Applications held at Istanbul University, Turkey, in July 2020. Harmony Search (HS) is one of the most popular metaheuristic algorithms, developed in 2001 by Prof. Joong Hoon Kim and Prof. Zong Woo Geem, that mimics the improvisation process of jazz musicians to seek the best harmony. The book consists of research articles on novel and newly proposed optimization algorithms; the theoretical study of nature-inspired optimization algorithms; numerically established results of nature-inspired optimization algorithms; and real-world applications of optimization algorithms and synthetic benchmarking of optimization algorithms.