On the computational complexity of ordinal multi-objective unconstrained combinatorial optimization
Authors:
- José Rui FigueiraJFJosé Rui Figueira
- Kathrin KlamrothKKKathrin Klamroth
- Michael StiglmayrMSMichael Stiglmayr
- Julia Sudhoff SantosJSJulia Sudhoff Santos
Open Access
- 6 May 2025
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 61
Abstract
No abstract availableAll Related Versions
Funding Information
- Fundação para a Ciência e a Tecnologia (UIDB/00097/2020)
- Deutscher Akademischer Austauschdienst (57711909)
- Universidade de Lisboa Instituto Superior Tecnico
- Bergische Universität Wuppertal
This publication has 10 references indexed in Scilit:
- A simple, efficient and versatile objective space algorithm for multiobjective integer programmingMathematical Methods of Operations Research, 2024
- Ordinal optimization through multi-objective reformulationEuropean Journal of Operational Research, 2023
- Multi-objective matroid optimization with ordinal weightsDiscrete Applied Mathematics, 2022
- The binary knapsack problem with qualitative levelsEuropean Journal of Operational Research, 2021
- Shortest paths with ordinal weightsEuropean Journal of Operational Research, 2020
- Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutionsJournal of Global Optimization, 2019
- The Multiobjective Shortest Path Problem Is NP-Hard, or Is It?2017
- Easy to say they are Hard, but Hard to see they are Easy- Towards a Categorization of Tractable Multiobjective Combinatorial Optimization ProblemsJournal of Multi-Criteria Decision Analysis, 2016
- A survey and annotated bibliography of multiobjective combinatorial optimizationOR Spectrum, 2000
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984