News
Distributed Constraint Optimisation and Search Algorithms form a vital framework for addressing complex decision‐making and scheduling problems in multi-agent systems. These algorithms distribute ...
On Monday the 2nd of December 2019, M.Sc. Paul Saikko will defend his doctoral thesis on Implicit Hitting Set Algorithms for Constraint Optimization. The thesis is a part of research done in the ...
In this paper, we aim to find ecient solutions of a multi-objective optimization problem over a linear matrix inequality (LMI in short), in which the objective functions are SOS-convex polynomials. We ...
We investigate risk-averse stochastic optimization problems with a risk-shaping constraint in the form of a stochastic-order relation. Both univariate and multivariate orders are considered. We extend ...
On December 2, 2019 Saikko successfully defended his doctoral thesis Implicit Hitting Set Algorithms for Constraint Optimization M.Sc. Paul Saikko succesfully defended his doctoral ...
Recently, a research team from the Rudolf Technology Center in Slovenia proposed a new method to optimize the sparse subgraph problem, which has wide applications in fields such as network analysis ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback