Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (Q2103031): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2022.07.031 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4287448641 / rank | |||
Normal rank | |||
Latest revision as of 20:20, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner |
scientific article |
Statements
Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (English)
0 references
12 December 2022
0 references
group decisions and negotiations
0 references
combinatorial optimization
0 references
computational social choice
0 references
ranking aggregation
0 references
Kemeny method
0 references
