We investigate the computational hardness of the Connectivity, the Strong Connectivity and the Broadcast type of Range Assignment Problems in R2 and R3. We present new reductions ...
Abstract. Consultant-Guided Search (CGS) is a recent swarm intelligence metaheuristic for combinatorial optimization problems, inspired by the way real people make decisions based ...
In this paper we study two formulation reductions for the quadratic assignment problem (QAP). In particular we apply these reductions to the well known Adams and Johnson [2] integ...
Huizhen Zhang, Cesar Beltran-Royo, Miguel Constant...
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
Michael M. Zavlanos, Leonid Spesivtsev, George J. ...
A heuristic technique that combines a genetic algorithm with a Tabu Search algorithm is applied to the Quadratic Assignment Problem (QAP). The hybrid algorithm improves the result...