activity
20132022
most citedImproving Lower Bounds for the Quadratic Assignment Problem by applying a Distributed Dual Ascent Algorithm

12 citations · 13 across the 4 of their papers we have counts for

collaborators
Showing 2015Show all

1 paper · 1 filter

cs.DC2015★ 1 cited

Solving the Quadratic Assignment Problem on heterogeneous environment (CPUs and GPUs) with the application of Level 2 Reformulation and Linearization Technique

Alexandre Domingues Gonçalves, Artur Alves Pessoa, Lúcia Maria de Assumpção Drummond +2

The Quadratic Assignment Problem, QAP, is a classic combinatorial optimization problem, classified as NP-hard and widely studied. This problem consists in assigning N facilities to…