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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Best Price, Torrance, CA, Etats-Unis
Etat : New. SUPER FAST SHIPPING. N° de réf. du vendeur 9780792348788
Quantité disponible : 2 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 755826-n
Quantité disponible : 15 disponible(s)
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Feb2416190182723
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9780792348788_new
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : New. N° de réf. du vendeur 755826-n
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 755826
Quantité disponible : 15 disponible(s)
Vendeur : moluna, Greven, Allemagne
Gebunden. Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 pract. N° de réf. du vendeur 5968322
Quantité disponible : Plus de 20 disponibles
Vendeur : GreatBookPricesUK, Woodford Green, Royaume-Uni
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 755826
Quantité disponible : Plus de 20 disponibles
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. 308. N° de réf. du vendeur 26551404
Quantité disponible : 4 disponible(s)
Vendeur : preigu, Osnabrück, Allemagne
Buch. Etat : Neu. The Quadratic Assignment Problem | Theory and Algorithms | E. Cela | Buch | xv | Englisch | 1997 | Springer US | EAN 9780792348788 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. N° de réf. du vendeur 102550551
Quantité disponible : 5 disponible(s)