An optimization based algorithm for solving the generalized assignment problem (GAP) is proposed in the paper. The primary concept underlying our algorithm is a stepwise incomplete branch and bound ...

The quadratic assignment problem (QAP) is arguably one of the hardest NP-hard discrete optimization problems. Problems of dimension greater than 25 are still considered to be large scale. Current ...

An example of the quadratic assignment problem (QAP) is the facility location problem, in which n facilities are assigned, at minimum cost, to n sites. Between each pair of facilities, there is a ...

Optimization of these parameters can be carried out efficiently using either fixed–point iterations (as in TRW) or sub-gradient based techniques. Second, we introduce a new technique that utilizes ...