Many optimization problems in practical applications involve conflicting interests and objectives. For example, a component should not only be stable but also light and cost-effective. In the same way, we are usually not only interested in the shortest route, but also in a route that is also fast and without highway tolls. In this seminar we will investigate, in particular, combinatorial multi-objective optimization problems, such as the multi-objective shortest paths problem, multi-objective minimum spanning tree problem, and the multi-objective assignment problem. These problems have in common that their single-objective counterparts are efficiently solvable, while they are hard to tackle in the multi-objective setting. Based on this observation we will study complexity theory in the context of multi-objective optimization problems. Moreover, we will investigate multi-objective optimization problems with respect to other ordering cones, in particular, ordinal optimization problems.
25 Settembre 2026, ore 14
Michael Stiglmayr
University of Wuppertal, Germany
In person: Room VII - Castellano (ground floor) building CU002 Scienze Statistiche
Webinar: https://uniroma1.zoom.us/j/88612949698?pwd=JANn1cR9JDkYa25Wd2nanC6TmoSLQb.1