On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization

José Rui Figueira, Kathrin Klamroth, Michael Stiglmayr +1

Multi-objective unconstrained combinatorial optimization problems (MUCO) are in general hard to solve, i.e., the corresponding decision problem is NP-hard and the outcome set is in…