Tractability in multiobjective combinatorial optimization

Description

The main research goal of this project is to characterize and recognize polynomial solvability of multiobjetive combinatorial optimization problems. The project aims at exploring particular cases in order to understand the role of the problem structure, objectives and constraints in the tractability of these problems. Based on these findings, we plan to develop general methodologies to design efficient polynomial time algorithms for those particular cases. Of particular interest is to develop solution methods that find a representative subset of the Pareto optimal set, maximizing a given representation quality.

Researchers

Funded by

FCT/DAAD

Partners

University of Lisboa (IST), University of Wuppertal, University of Koblenz-Landau

Total budget

10 000,00 €

Local budget

3 500,00 €

Keywords

Multiobjective optiimization,algorithms

Start Date

2015-02-01

End Date

2017-01-31

Journal Articles

Tech Report