2018
DOI: 10.14419/ijet.v7i3.20.18722 View full text |Buy / Rent full text
|
|

Abstract: The quadratic assignment problem (QAP) is one of the fundamental combinatorial optimization problem (COPs) in the branch of optimization or operation research in mathematics, from the category of the Facilities Location Problems (FLPs).  The quadratic assignment problem (QAP) be appropriate to the group of NP-hard issues and is measured as a challenging problem of the combinatorial optimization. QAP in Location Theory considers one of the problems of facilities tracing which the rate of locating a facility be … Show more

Help me understand this report

Search citation statements

Order By: Relevance
Select...
0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals