The Quadratic Assignment Problem: Theory and Algorithms - E. Cela
-35% koodilla BOOKS
Toimitus 17-23 arkipäivässä
30 päivän palautusoikeus
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. I ... Täydellinen kuvaus
Saatat myös pitää
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
How To Think About AI: A Guide For The Perplexed
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
AI Engineering: Building Applications with Foundation Models
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
How to Talk to AI: (And How Not To)
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
The Art of Game Design: A Book of Lenses
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
How Linux Works: What Every Superuser Should Know
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Hands-On Large Language Models: Language Understanding and Generation
Maarten Grootendorst, Jay Alammar
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Clean Architecture: A Craftsman's Guide to Software Structure and Design
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
World of Warcraft Chronicle, Volume 2
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-35% koodilla BOOKS
Toimittajalla varastossa
TOP
Deep Learning: Foundations and Concepts
Christopher M. Bishop, Hugh Bishop
-35% koodilla BOOKS
Toimittajalla varastossa
Kuvaus
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.
Lisätietoja
| Kirjoittaja | E. Cela |
|---|---|
| Julkaisija | Springer US |
| Series | Combinatorial Optimization |
| Julkaisuvuosi | 1997 |
| Kannen tyyppi | Kovakantinen |
| EAN | 9780792348788 |