Exploitation of a crisp relation in a ranking problem (Q1193764): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q3997404 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Ranking methods for valued preference relations: A characterization of a method based on leaving and entering flows / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Preference modelling / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf00134150 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2040598781 / rank | |||
Normal rank | |||
Latest revision as of 08:28, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Exploitation of a crisp relation in a ranking problem |
scientific article |
Statements
Exploitation of a crisp relation in a ranking problem (English)
0 references
27 September 1992
0 references
preference relation
0 references
outranking
0 references
ranking
0 references
0 references
