A lexicographically optimal completion for pairwise comparison matrices with missing entries
Ágoston, Kolos Csaba and Csató, László (2024) A lexicographically optimal completion for pairwise comparison matrices with missing entries. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 314 (3). pp. 1078-1086. ISSN 0377-2217 10.1016/j.ejor.2023.10.035
|
Text
Agoston_1078_34231363_ny.pdf Download (800kB) | Preview |
Official URL: https://doi.org/10.1016/j.ejor.2023.10.035
| Item Type: | Article |
|---|---|
| Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
| Divisions: | Research Laboratory on Engineering & Management Intelligence > Research Group of Operations Research and Decision Systems |
| SWORD Depositor: | MTMT Injector |
| Depositing User: | MTMT Injector |
| Date Deposited: | 03 Apr 2024 13:38 |
| Last Modified: | 12 Jun 2025 06:55 |
| URI: | https://eprints.sztaki.hu/id/eprint/10711 |
 |
Update Item |
