عنوان
پدید آورنده
موضوع
رده
کتابخانه
محل استقرار
INTERNATIONAL STANDARD BOOK NUMBER
(Number (ISBN
9781441947864
(Number (ISBN
9781475727876
NATIONAL BIBLIOGRAPHY NUMBER
Number
b402330
TITLE AND STATEMENT OF RESPONSIBILITY
Title Proper
The Quadratic Assignment Problem
General Material Designation
[Book]
Other Title Information
Theory and Algorithms /
First Statement of Responsibility
by Eranda Çela.
.PUBLICATION, DISTRIBUTION, ETC
Place of Publication, Distribution, etc.
Boston, MA :
Name of Publisher, Distributor, etc.
Imprint: Springer,
Date of Publication, Distribution, etc.
1998.
SERIES
Series Title
Combinatorial Optimization,
Volume Designation
1
ISSN of Series
1388-3011 ;
CONTENTS NOTE
Text of Note
1 Problem Statement and Complexity Aspects -- 2 Exact Algorithms and Lower Bounds -- 3 Heuristics and Asymptotic Behavior -- 4 QAPS on Specially Structured Matrices -- 5 Two More Restricted Versions of the QAP -- 6 QAPS Arising as Optimization Problems in Graphs -- 7 On the Biquadratic Assignment Problem (BIQAP) -- References -- Notation Index.
0
SUMMARY OR ABSTRACT
Text of Note
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.
OTHER EDITION IN ANOTHER MEDIUM
International Standard Book Number
9781441947864
PIECE
Title
Springer eBooks
TOPICAL NAME USED AS SUBJECT
Algorithms.
Combinatorics.
Computational complexity.
Information theory.
Mathematical optimization.
Mathematics.
PERSONAL NAME - PRIMARY RESPONSIBILITY
Çela, Eranda.
CORPORATE BODY NAME - ALTERNATIVE RESPONSIBILITY
SpringerLink (Online service)
ORIGINATING SOURCE
Date of Transaction
20190307161300.0
ELECTRONIC LOCATION AND ACCESS
Electronic name
مطالعه متن کتاب [Book]
Y
