In this paper we propose a new lower bounding procedure for the Quadratic Assignment Problem based on a generalization of the well-known Gilomore-Lawler procedure for a higher order reformulation. Computational results on some benchmark instances show the strength of the new approach compared with other lower bounds
The Reformulation Linearization Technique (RLT) applied to the Quadratic Assignment Problem yields m...
The Reformulation Linearization Technique (RLT) applied to the Quadratic Assignment Problem yields m...
Abstract: In past several linearization of the Quadratic Assignment Problem (QAP) which is a NP-hard...
In this paper we propose a new lower bounding procedure for the Quadratic Assignment Problem based o...
In this paper we propose a new lower bounding procedure for the Quadratic Assignment Problem based o...
In this paper we propose a new lower bounding procedure for the Quadratic Assignment Problem based o...
. We investigate the classical Gilmore-Lawler lower bound for the quadratic assignment problem. We p...
The authors develop an algorithm that is based on the linearizaition and decomposition of a general ...
AbstractWe discuss the relationship between Gilmore–Lawler lower bounds with decomposition for the q...
The paper presents a new powerful technique to linearize the quadratic assignment problem. There are...
The quadratic assignment problem (QAP) is known as one of the most interesting and challenging probl...
The quadratic assignment problem (QAP) is known as one of the most interesting and challenging probl...
The Reformulation Linearization Technique (RLT) applied to the Quadratic Assignment Problem yields m...
The Reformulation Linearization Technique (RLT) applied to the Quadratic Assignment Problem yields m...
The Reformulation Linearization Technique (RLT) applied to the Quadratic Assignment Problem yields m...
The Reformulation Linearization Technique (RLT) applied to the Quadratic Assignment Problem yields m...
The Reformulation Linearization Technique (RLT) applied to the Quadratic Assignment Problem yields m...
Abstract: In past several linearization of the Quadratic Assignment Problem (QAP) which is a NP-hard...
In this paper we propose a new lower bounding procedure for the Quadratic Assignment Problem based o...
In this paper we propose a new lower bounding procedure for the Quadratic Assignment Problem based o...
In this paper we propose a new lower bounding procedure for the Quadratic Assignment Problem based o...
. We investigate the classical Gilmore-Lawler lower bound for the quadratic assignment problem. We p...
The authors develop an algorithm that is based on the linearizaition and decomposition of a general ...
AbstractWe discuss the relationship between Gilmore–Lawler lower bounds with decomposition for the q...
The paper presents a new powerful technique to linearize the quadratic assignment problem. There are...
The quadratic assignment problem (QAP) is known as one of the most interesting and challenging probl...
The quadratic assignment problem (QAP) is known as one of the most interesting and challenging probl...
The Reformulation Linearization Technique (RLT) applied to the Quadratic Assignment Problem yields m...
The Reformulation Linearization Technique (RLT) applied to the Quadratic Assignment Problem yields m...
The Reformulation Linearization Technique (RLT) applied to the Quadratic Assignment Problem yields m...
The Reformulation Linearization Technique (RLT) applied to the Quadratic Assignment Problem yields m...
The Reformulation Linearization Technique (RLT) applied to the Quadratic Assignment Problem yields m...
Abstract: In past several linearization of the Quadratic Assignment Problem (QAP) which is a NP-hard...
DOI
Add to ORKG