Search
Now showing items 1-2 of 2
Approaching the Quadratic Assignment Problem with Kernels of Mallows Models under the Hamming Distance
(2019-07)
The Quadratic Assignment Problem (QAP) is a specially challenging permutation-based np-hard combinatorial optimization problem, since instances of size $n>40$ are seldom solved using exact methods. In this sense, many ...
Mallows and generalized Mallows model for matchings
(2019-02-25)
The Mallows and Generalized Mallows Models are two of the most popular probability models for distribu- tions on permutations. In this paper, we consider both models under the Hamming distance. This models can be seen as ...