The Quadratic Assignment Problem

Author : E. Cela
Publisher : Springer Science & Business Media
ISBN 13 : 1475727879
Total Pages : 296 pages
Book Rating : 4.76/5 ( download)

DOWNLOAD NOW!

Download or read book The Quadratic Assignment Problem written by E. Cela and published by Springer Science & Business Media. This book was released on 2013-03-14 with total page 296 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Author : E. Cela
Publisher : Springer
ISBN 13 : 9780792348788
Total Pages : 287 pages
Book Rating : 4.88/5 ( download)

DOWNLOAD NOW!

Download or read book The Quadratic Assignment Problem written by E. Cela and published by Springer. This book was released on 1997-12-31 with total page 287 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Author : Ding-Zhu Du
Publisher : Springer Science & Business Media
ISBN 13 : 0387238301
Total Pages : 395 pages
Book Rating : 4.02/5 ( download)

DOWNLOAD NOW!

Download or read book Handbook of Combinatorial Optimization written by Ding-Zhu Du and published by Springer Science & Business Media. This book was released on 2006-08-18 with total page 395 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Author : Rainer Burkard
Publisher : SIAM
ISBN 13 : 1611972221
Total Pages : 403 pages
Book Rating : 4.21/5 ( download)

DOWNLOAD NOW!

Download or read book Assignment Problems, Revised Reprint written by Rainer Burkard and published by SIAM. This book was released on 2012-10-31 with total page 403 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Author : Celso C. Ribeiro
Publisher : Springer Science & Business Media
ISBN 13 : 3540220674
Total Pages : 595 pages
Book Rating : 4.71/5 ( download)

DOWNLOAD NOW!

Download or read book Experimental and Efficient Algorithms written by Celso C. Ribeiro and published by Springer Science & Business Media. This book was released on 2004-05-11 with total page 595 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book constitutes the refereed proceedings of the Third International Workshop on Experimental and Efficient Algorithms, WEA 2004, held in Angra dos Reis, Brazil in May 2004. The 40 revised full papers presented together with abstracts of two invited talks were carefully reviewed and selected from numerous submissions. The book is devoted to the areas of design, analysis, and experimental evaluation of algorithms. Among the topics covered are scheduling, heuristics, combinatorial optimization, evolutionary optimization, graph computations, labeling, robot navigation, shortest path algorithms, flow problems, searching, randomization and derandomization, string matching, graph coloring, networking, error detecting codes, timetabling, sorting, energy minimization, etc.

Author : Marco Dorigo
Publisher : MIT Press
ISBN 13 : 9780262042192
Total Pages : 324 pages
Book Rating : 4.93/5 ( download)

DOWNLOAD NOW!

Download or read book Ant Colony Optimization written by Marco Dorigo and published by MIT Press. This book was released on 2004-06-04 with total page 324 pages. Available in PDF, EPUB and Kindle. Book excerpt: An overview of the rapidly growing field of ant colony optimization that describes theoretical findings, the major algorithms, and current applications. The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses. The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered in the chapter, and exercises. Ant Colony Optimization will be of interest to academic and industry researchers, graduate students, and practitioners who wish to learn how to implement ACO algorithms.

Author : Michael Patriksson
Publisher : Courier Dover Publications
ISBN 13 : 0486802272
Total Pages : 240 pages
Book Rating : 4.75/5 ( download)

DOWNLOAD NOW!

Download or read book The Traffic Assignment Problem written by Michael Patriksson and published by Courier Dover Publications. This book was released on 2015-01-19 with total page 240 pages. Available in PDF, EPUB and Kindle. Book excerpt: This monograph provides both a unified account of the development of models and methods for the problem of estimating equilibrium traffic flows in urban areas and a survey of the scope and limitations of present traffic models. The development is described and analyzed by the use of the powerful instruments of nonlinear optimization and mathematical programming within the field of operations research. The first part is devoted to mathematical models for the analysis of transportation network equilibria; the second deals with methods for traffic equilibrium problems. This title will interest readers wishing to extend their knowledge of equilibrium modeling and analysis and of the foundations of efficient optimization methods adapted for the solution of large-scale models. In addition to its value to researchers, the treatment is suitable for advanced graduate courses in transportation, operations research, and quantitative economics.

Author : Leonard Barolli
Publisher : Springer
ISBN 13 : 3030128393
Total Pages : 579 pages
Book Rating : 4.95/5 ( download)

DOWNLOAD NOW!

Download or read book Advances in Internet, Data and Web Technologies written by Leonard Barolli and published by Springer. This book was released on 2019-02-05 with total page 579 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book presents original contributions on the theories and practices of emerging Internet, Data and Web technologies and their applications in businesses, engineering and academia. As a key feature, it addresses advances in the life-cycle exploitation of data generated by digital ecosystem technologies. The Internet has become the most proliferative platform for emerging large-scale computing paradigms. Among these, Data and Web technologies are two of the most prominent paradigms, manifesting in a variety of forms such as Data Centers, Cloud Computing, Mobile Cloud, Mobile Web Services, and so on. These technologies altogether create a digital ecosystem whose cornerstone is the data cycle, from capturing to processing, analysis and visualization. The need to investigate various research and development issues in this digital ecosystem has been made even more pressing by the ever-increasing demands of real-life applications, which are based on storing and processing large amounts of data. Given its scope, the book offers a valuable asset for all researchers, software developers, practitioners and students interested in the field of Data and Web technologies.

Author : Panos M. Pardalos
Publisher : American Mathematical Soc.
ISBN 13 : 9780821870624
Total Pages : 380 pages
Book Rating : 4.29/5 ( download)

DOWNLOAD NOW!

Download or read book Quadratic Assignment and Related Problems written by Panos M. Pardalos and published by American Mathematical Soc.. This book was released on 1994-01-01 with total page 380 pages. Available in PDF, EPUB and Kindle. Book excerpt: The methods described here include eigenvalue estimates and reduction techniques for lower bounds, parallelization, genetic algorithms, polyhedral approaches, greedy and adaptive search algorithms.

Author : Panos M. Pardalos
Publisher : Springer Science & Business Media
ISBN 13 : 1475731558
Total Pages : 317 pages
Book Rating : 4.52/5 ( download)

DOWNLOAD NOW!

Download or read book Nonlinear Assignment Problems written by Panos M. Pardalos and published by Springer Science & Business Media. This book was released on 2013-03-09 with total page 317 pages. Available in PDF, EPUB and Kindle. Book excerpt: Nonlinear Assignment Problems (NAPs) are natural extensions of the classic Linear Assignment Problem, and despite the efforts of many researchers over the past three decades, they still remain some of the hardest combinatorial optimization problems to solve exactly. The purpose of this book is to provide in a single volume, major algorithmic aspects and applications of NAPs as contributed by leading international experts. The chapters included in this book are concerned with major applications and the latest algorithmic solution approaches for NAPs. Approximation algorithms, polyhedral methods, semidefinite programming approaches and heuristic procedures for NAPs are included, while applications of this problem class in the areas of multiple-target tracking in the context of military surveillance systems, of experimental high energy physics, and of parallel processing are presented. Audience: Researchers and graduate students in the areas of combinatorial optimization, mathematical programming, operations research, physics, and computer science.