Ordinal optimization through multi-objective reformulation

DOI10.1016/j.ejor.2023.04.042arXiv2204.02003OpenAlexW4367835814MaRDI QIDQ6096566

Michael Stiglmayr, Kathrin Klamroth, Julia Sudhoff

Publication date: 15 September 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.02003

zbMATH Keywords

combinatorial optimizationmultiple objective programmingordering conesordinal objective functions

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the representation of the search region in multi-objective optimization
• Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
• Solving efficiently the 0-1 multi-objective knapsack problem
• Binary interactions and subset choice
• Preference structures and their numerical representations
• Outcome space partition of the weight set in multiobjective linear programming
• Scalarizing vector optimization problems
• Fair division of indivisible items
• Finite linear qualitative probability
• The binary knapsack problem with qualitative levels
• Shortest paths with ordinal weights
• Computing representations using hypervolume scalarizations
• The multiobjective multidimensional knapsack problem: a survey and a new approach
• Search for the best compromise solution on Multiobjective shortest path problem
• A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
• Fair Division under Ordinal Preferences: Computing Envy-Free Allocations of Indivisible Goods
• Vector Optimization
• Committee Selection with a Weight Constraint Based on a Pairwise Dominance Relation
• Assignment Problems
• Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
• Lectures on Polytopes
• An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem
• Multicriteria Optimization
• Sorted-Pareto Dominance and Qualitative Notions of Optimality
• Multi-objective matroid optimization with ordinal weights

This page was built for publication: Ordinal optimization through multi-objective reformulation