Optimization with Ordinal Costs An Overview

Julia Sudhoff Santos ()
Additional contact information
Julia Sudhoff Santos: University of Wuppertal, School of Mathematics and Natural Sciences, IMACM

Chapter Chapter 71 in Operations Research Proceedings 2023, 2025, pp 559-565 from Springer

Abstract: Abstract This work summarizes the results of my Ph.D. thesis on ordinal costs in combinatorial optimization. Ordinal costs model the quality of objects whenever numerical values are not appropriate or available. As an example the safety of a street for a cyclist can be ranked in ordered categories, like, e.g., safe (bike lane), medium safe (slow traffic) and unsafe (main road). Other examples for ordinal costs relate to quality, sustainability and rankings of, e.g., olympic medals. We consider ordinal costs for general combinatorial optimization problems and analyze the interrelation between ordinal optimization and multi-objective optimization. Moreover, in the thesis for the specific case of matroid optimization problems very efficient solution algorithms are suggested. In this paper the ideas of the solution methods and the main theoretical results are summarized.

Keywords: Ordinal costs; Multiple objective programming; Combinatorial optimization (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-58405-3_71

Ordering information: This item can be ordered from
http://www.springer.com/9783031584053

DOI: 10.1007/978-3-031-58405-3_71

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().