Defines general stability as a distance-sensitive robustness measure for weighted rankings and provides algorithms including a 2D sweep, multidimensional sampler, and Conv-SC for quasiconvex distances.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Introduces the Mixture Linear Ordering Problem with mixed-integer programming formulations and a multi-start matheuristic to recover latent groups and their rankings from aggregate preference matrices.
citing papers explorer
-
The General Stability of Ranking
Defines general stability as a distance-sensitive robustness measure for weighted rankings and provides algorithms including a 2D sweep, multidimensional sampler, and Conv-SC for quasiconvex distances.