Rankability and linear ordering problem : probabilistic insight and algorithms
Year of publication: |
2023
|
---|---|
Authors: | Szczecinski, Leszek ; Sukheja, Harsh |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 159.2023, p. 1-13
|
Subject: | Bayesian estimation | Combinatorial optimization | Linear ordering problem | Rankability | Ranking | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Bayes-Statistik | Bayesian inference | Scheduling-Verfahren | Scheduling problem | Ranking-Verfahren | Ranking method | Wahrscheinlichkeitsrechnung | Probability theory |
-
Ranking robustness and its application to evacuation planning
Goerigk, Marc, (2018)
-
Mixed-integer formulations for the Capacitated Rank Pricing Problem with envy
Domínguez, Concepción, (2022)
-
Accelerated MM algorithms for inference of ranking scores from comparison data
Vojnović, Milan, (2023)
- More ...
-
Reliability of Solutions in Linear Ordering Problem : Probabilistic Insight and Algorithms
Szczecinski, Leszek, (2023)
- More ...