Results 231 to 240 of about 95,488 (287)
Some of the next articles are maybe not open access.
Solving the Quadratic Assignment Problem
Cybernetics and Systems Analysis, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergienko, I. V. +3 more
openaire +1 more source
The Rank-One Quadratic Assignment Problem
INFORMS Journal on Computing, 2021In this paper, we study the quadratic assignment problem with a rank-one cost matrix (QAP-R1). Four integer-programming formulations are introduced of which three are assumed to have partial integer data. Unlike the standard quadratic assignment problem, some of our formulations can solve reasonably large instances of QAP-R1 with impressive running ...
Yang Wang +5 more
openaire +2 more sources
QAPLIB – A Quadratic Assignment Problem Library
Journal of Global Optimization, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Burkard, Rainer E. +2 more
openaire +3 more sources
European Journal of Operational Research, 1984
Consider the following situation: n buildings are to be erected on n possible sites. It is known, how often people have to go from building j to building q per day. The buildings shall be erected such that the total walking distance of the people becomes minimal.
openaire +2 more sources
Consider the following situation: n buildings are to be erected on n possible sites. It is known, how often people have to go from building j to building q per day. The buildings shall be erected such that the total walking distance of the people becomes minimal.
openaire +2 more sources
The Quadratic Assignment Problem
Management Science, 1963This paper presents a formulation of the quadratic assignment problem, of which the Koopmans-Beckmann formulation is a special case. Various applications for the formulation are discussed. The equivalence of the problem to a linear assignment problem with certain additional constraints is demonstrated.
openaire +2 more sources
The quadratic assignment problem
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2019The Quadratic Assignment Problem (QAP) is a classical NP-hard combinatorial optimization problem. In the paper will be presented suitable metaheuristic algorithm HC12. The algorithm is population based and uses a massive parallel search of the binary space which represents the solution space of the QAP. The presented implementation of the metaheuristic
Radomil Matousek +2 more
openaire +1 more source
2009
The quadratic assignment problem (QAP) in location Theory is the problem of locating facilities the cost of placing a facility depends on the distances from other facilities and also the interaction with other facilities. QAP was introduced by Koopmans and Beckman in 1957 who were trying to model a facilities location problem.
Masoumeh Bayat, Mahdieh Sedghi
openaire +1 more source
The quadratic assignment problem (QAP) in location Theory is the problem of locating facilities the cost of placing a facility depends on the distances from other facilities and also the interaction with other facilities. QAP was introduced by Koopmans and Beckman in 1957 who were trying to model a facilities location problem.
Masoumeh Bayat, Mahdieh Sedghi
openaire +1 more source
An algorithm for Quadratic Assignment Problems
European Journal of Operational Research, 1995zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Wu-Ji, Smith, J. MacGregor
openaire +1 more source
Subset Quadratic Assignment Problem
2012Variants of QAP have become the hot lines in research on NP-Hard combinatorial optimization problems. There exists a new kind of problem which can't be modeled as QAP or its existing variants, in applications such as hospital layout whose facility must be assigned to one location in some predefined subset. This new problem is modeled as the subset QAP (
He Jiang, Yan Hu
openaire +1 more source