Abstract: This paper presents a hybrid metaheuristic for solving the Quadratic Assignment Problem (QAP). The proposed algorithm involves using the Greedy Randomized Adaptive Search Procedure (GRASP) ...

This is a Python implementation of the Doubly Stochastic Projected Fixed Point (DSPFP) algorithm for solving the Quadratic Assignment Problem / Graph Matching..

There are tens of thousands of pythons in the Florida wild, attacking animals and damaging ecosystems – and the quest to stop them has become a collective crusade On a Thursday afternoon in St ...

1 Department of Mathematics, Kwame Nkrumah University of Science and Technology, Kumasi, Ghana. 2 Department of Mathematics and Statistics, University of Energy and Natural Recourses, Sunyani, Ghana.

Abstract: This paper presents two meta-heuristic algorithms to solve the quadratic assignment problem. The iterated greedy algorithm has two main components, which are destruction and construction ...

ABSTRACT: Balas and Mazzola linearization (BML) is widely used in devising cutting plane algorithms for quadratic 0-1 programs. In this article, we improve BML by first strengthening the primal ...