عنوان
پدید آورنده
موضوع
رده
کتابخانه
محل استقرار
شابک
شابک
9781441947864
شابک
9781475727876
شماره کتابشناسی ملی
شماره
b402330
عنوان و نام پديدآور
عنوان اصلي
The Quadratic Assignment Problem
نام عام مواد
[Book]
ساير اطلاعات عنواني
Theory and Algorithms /
نام نخستين پديدآور
by Eranda Çela.
وضعیت نشر و پخش و غیره
محل نشرو پخش و غیره
Boston, MA :
نام ناشر، پخش کننده و غيره
Imprint: Springer,
تاریخ نشرو بخش و غیره
1998.
فروست
عنوان فروست
Combinatorial Optimization,
مشخصه جلد
1
شاپا ي ISSN فروست
1388-3011 ;
یادداشتهای مربوط به مندرجات
متن يادداشت
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
یادداشتهای مربوط به خلاصه یا چکیده
متن يادداشت
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.
ویراست دیگر از اثر در قالب دیگر رسانه
شماره استاندارد بين المللي کتاب و موسيقي
9781441947864
قطعه
عنوان
Springer eBooks
موضوع (اسم عام یاعبارت اسمی عام)
موضوع مستند نشده
Algorithms.
موضوع مستند نشده
Combinatorics.
موضوع مستند نشده
Computational complexity.
موضوع مستند نشده
Information theory.
موضوع مستند نشده
Mathematical optimization.
موضوع مستند نشده
Mathematics.
نام شخص به منزله سر شناسه - (مسئولیت معنوی درجه اول )
مستند نام اشخاص تاييد نشده
Çela, Eranda.
نام تنالگان _ (مسئولیت معنوی برابر)
مستند نام تنالگان تاييد نشده
SpringerLink (Online service)
مبدا اصلی
تاريخ عمليات
20190307161300.0
دسترسی و محل الکترونیکی
نام الکترونيکي
مطالعه متن کتاب اطلاعات رکورد کتابشناسی
نوع ماده
[Book]
اطلاعات دسترسی رکورد
تكميل شده
Y
