Summary the objective of the quadratic assignment problem qap is to assign n facilities to n locations in such a way as to minimize the assignment costthe assignment cost is the sum over all pairs of the flow between a pair of facilities multiplied by the distance between their assigned locations. Buy the quadratic assignment problem theory and algorithms combinatorial optimization on amazoncom free shipping on qualified orders. The quadratic assignment problem qap is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics from the category of the facilities location problems the problem models the following real life problem there are a set of n facilities and a set of n locations. 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
How it works:
1. Register a Free 1 month Trial Account.
2. Download as many books as you like ( Personal use )
3. No Commitment. Cancel anytime.
4. Join Over 100.000 Happy Readers.
5. That's it. What you waiting for? Sign Up and Get Your Books.