Efficient Solution Algorithms for the Ordinal Biobjective Unconstrained Combinatorial Optimization Problem
- 13 November 2026
- book chapter
- Published by Springer Nature
- p. 375-390
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- On the representation of the non-dominated set of multiobjective optimization problemsEuropean Journal of Operational Research, 2025
- On the computational complexity of ordinal multi-objective unconstrained combinatorial optimizationOperations Research Letters, 2025
- Ordinal optimization through multi-objective reformulationEuropean Journal of Operational Research, 2023
- The binary knapsack problem with qualitative levelsEuropean Journal of Operational Research, 2021
- Multi-objective unconstrained combinatorial optimization: a polynomial bound on the number of extreme supported solutionsJournal of Global Optimization, 2019
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernelsEuropean Journal of Operational Research, 2017
- Robust ordinal regression in preference learning and rankingMachine Learning, 2013
- Connectedness of Efficient Solutions in Multiple Objective Combinatorial OptimizationJournal of Optimization Theory and Applications, 2011
- Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation2011
- Binary interactions and subset choiceEuropean Journal of Operational Research, 1996