The paper presents a new powerful technique to linearize the quadratic assignment problem. There are so many techniques available in literature that used In all these linear formulations, both number of variables and constraints significantly increase. problem (QAP) is well-known whereby set facilities allocated locations such way cost function distance flow between facilities. this problem, co...

A small number of combinatorial optimization problems have search spaces that correspond to elementary landscapes, where the objective function f is an eigenfunction of the Laplacian that describes the neighborhood structure of the search space. Many problems are not elementary; however, the objective function of a combinatorial optimization problem can always be expressed as a superposition of...