Chen, J. (2025). MP-Aggregation MP(R,2-WO) is Polynomial-Time Solvable When the Output Should Be Dichotomous Weak Preference Order.
Style de citation Chicago (17e éd.)Chen, Jiehua. MP-Aggregation MP(R,2-WO) Is Polynomial-Time Solvable When the Output Should Be Dichotomous Weak Preference Order. 2025.
Style de citation MLA (9e éd.)Chen, Jiehua. MP-Aggregation MP(R,2-WO) Is Polynomial-Time Solvable When the Output Should Be Dichotomous Weak Preference Order. 2025.
Attention : ces citations peuvent ne pas être correctes à 100%.