Now showing items 1-3 of 3
The Linear Ordering Problem Revisited
The Linear Ordering Problem is a popular combinatorial optimisation problem which has been extensively addressed in the literature. However, in spite of its popularity, little is known about the characteristics of this ...
Extending Distance-based Ranking Models In Estimation of Distribution Algorithms
Recently, probability models on rankings have been proposed in the field of estimation of distribution algorithms in order to solve permutation-based combinatorial optimisation problems. Particularly, distance-based ranking ...
Sampling and learning the Mallows model under the Ulam distance
[EN]In this paper we deal with probability distributions over permutation spaces. The Probability model in use is the Mallows model. The distance for permutations that the model uses in the Ulam distance.