Univerza na Primorskem
Fakulteta za matematiko, naravoslovje in informacijske tehnologije
Več informacij o projektu / More info about the project
Opis / Description
SLO:
(SI) Cilj projekta je preučiti in posplošiti b-robustnost za različne klasične optimizacijske probleme na grafih, ki so osrednji gradniki mnogih robustnih optimizacijskih modelov v resničnem svetu in zato je teoretično razumevanje tovrstnih problemov osrednjega pomena. Pomembna primera takšnih problemov sta problem neodvisne množice in problem dominantne množice, ki se pogosto pojavljata kot podproblema praktičnih odločitev, na primer pri problemih postavitve objektov.
(EN) In this project, we aim to study and generalize bulk-robustness for different classic graph optimization problems, which are central building blocks of many real-world robust optimization models and hence central to their theoretical understanding. A prominent example of such a problem is the dominating set problem, which frequently appears as a subproblem of practical decisions, for instance in facility location problems.
(EN) In this project, we aim to study and generalize bulk-robustness for different classic graph optimization problems, which are central building blocks of many real-world robust optimization models and hence central to their theoretical understanding. A prominent example of such a problem is the dominating set problem, which frequently appears as a subproblem of practical decisions, for instance in facility location problems.