Now showing items 1-2 of 2
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 ...