Results 1  10
of
29,950
The Quadratic Assignment Problem
 TO APPEAR IN THE HANDBOOK OF COMBINATORIAL OPTIMIZATION
"... This paper aims at describing the state of the art on quadratic assignment problems (QAPs). It discusses the most important developments in all aspects of the QAP such as linearizations, QAP polyhedra, algorithms to solve the problem to optimality, heuristics, polynomially solvable special cases, an ..."
Abstract

Cited by 187 (3 self)
 Add to MetaCart
This paper aims at describing the state of the art on quadratic assignment problems (QAPs). It discusses the most important developments in all aspects of the QAP such as linearizations, QAP polyhedra, algorithms to solve the problem to optimality, heuristics, polynomially solvable special cases
Solving the Quadratic Assignment Problems by . . .
, 2007
"... This paper proposes a genetic algorithm based on a new replacement strategy to solve the quadratic assignment problems, which are NPhard. The new replacement strategy aims to improve the performance of the genetic algorithm through well balancing the convergence of the searching process and the di ..."
Abstract
 Add to MetaCart
This paper proposes a genetic algorithm based on a new replacement strategy to solve the quadratic assignment problems, which are NPhard. The new replacement strategy aims to improve the performance of the genetic algorithm through well balancing the convergence of the searching process
LINEARIZING QUADRATIC ASSIGNMENT PROBLEM
"... Abstract: In past several linearization of the Quadratic Assignment Problem (QAP) which is a NPhard problem have been given (See Lawler (1962) and Christofides et al. (1980)). Here, a new set of constraints that perfectly linearize the QAP is proposed. The new linearization is compared with other ..."
Abstract
 Add to MetaCart
Abstract: In past several linearization of the Quadratic Assignment Problem (QAP) which is a NPhard problem have been given (See Lawler (1962) and Christofides et al. (1980)). Here, a new set of constraints that perfectly linearize the QAP is proposed. The new linearization is compared with other
On the Maximum Quadratic Assignment Problem
"... Quadratic Assignment is a basic problem in combinatorial optimization, which generalizes several other problems such as Traveling Salesman, Linear Arrangement, Dense k Subgraph, and Clustering with given sizes. The input to the Quadratic Assignment Problem consists of two n × n symmetric nonnegativ ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
Quadratic Assignment is a basic problem in combinatorial optimization, which generalizes several other problems such as Traveling Salesman, Linear Arrangement, Dense k Subgraph, and Clustering with given sizes. The input to the Quadratic Assignment Problem consists of two n × n symmetric non
A Survey of the Quadratic Assignment Problem
"... Support The quadratic assignment problem (QAP) is very challengeable and interesting problem that can model many reallife problems. In this paper, we will simply discuss the meaning of quadratic assignment problem, solving techniques and we will give a survey of some developments and researches. ..."
Abstract
 Add to MetaCart
Support The quadratic assignment problem (QAP) is very challengeable and interesting problem that can model many reallife problems. In this paper, we will simply discuss the meaning of quadratic assignment problem, solving techniques and we will give a survey of some developments and researches.
Genetic Hybrids for the Quadratic Assignment Problem
 DIMACS Series in Mathematics and Theoretical Computer Science
, 1993
"... . A new hybrid procedure that combines genetic operators to existing heuristics is proposed to solve the Quadratic Assignment Problem (QAP). Genetic operators are found to improve the performance of both local search and tabu search. Some guidelines are also given to design good hybrid schemes. Thes ..."
Abstract

Cited by 109 (0 self)
 Add to MetaCart
. A new hybrid procedure that combines genetic operators to existing heuristics is proposed to solve the Quadratic Assignment Problem (QAP). Genetic operators are found to improve the performance of both local search and tabu search. Some guidelines are also given to design good hybrid schemes
Elementary landscape decomposition of the quadratic assignment problem
 In Proceedings of GECCO
, 2010
"... Elementary landscape decomposition of the quadratic assignment problem ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
Elementary landscape decomposition of the quadratic assignment problem
Lower bounds for the quadratic assignment problem
 University of Munich
, 1994
"... Abstract. We investigate the classical GilmoreLawler lower bound for the quadratic assignment problem. We provide evidence of the difficulty of improving the GilmoreLawler Bound and develop new bounds by means of optimal reduction schemes. Computational results are reported indicating that the new ..."
Abstract

Cited by 20 (5 self)
 Add to MetaCart
Abstract. We investigate the classical GilmoreLawler lower bound for the quadratic assignment problem. We provide evidence of the difficulty of improving the GilmoreLawler Bound and develop new bounds by means of optimal reduction schemes. Computational results are reported indicating
On the landscape ruggedness of the Quadratic Assignment Problem
 Theoretical Computer Science
, 1997
"... Local search based heuristics have been demonstrated to give very good results for approximately solve the Quadratic Assignment Problem (QAP). In this paper, following the works of Weinberger and Stadler, we introduce a parameter, called the ruggedness coefficient, which measures the ruggedness of t ..."
Abstract

Cited by 21 (2 self)
 Add to MetaCart
Local search based heuristics have been demonstrated to give very good results for approximately solve the Quadratic Assignment Problem (QAP). In this paper, following the works of Weinberger and Stadler, we introduce a parameter, called the ruggedness coefficient, which measures the ruggedness
SEARCHES FOR THE QUADRATIC ASSIGNMENT PROBLEM
"... Ce papier compare les méthodes heuristiques les plus efficaces pour le problème de l’affectation quadratique. Ces méthodes sont connues sous les noms de recherche tabou stricte, recherche tabou robuste, recherche tabou réactive et algorithme génétique hybride. Il est montré que l’efficacité de ces m ..."
Abstract
 Add to MetaCart
Ce papier compare les méthodes heuristiques les plus efficaces pour le problème de l’affectation quadratique. Ces méthodes sont connues sous les noms de recherche tabou stricte, recherche tabou robuste, recherche tabou réactive et algorithme génétique hybride. Il est montré que l’efficacité de ces
Results 1  10
of
29,950