We present a new interactive hybrid approach for solving multicriteria optimization problems where features of approximation methods and interactive approaches are incorporated. We produce rough ...

Geometric optimisation and approximation algorithms form a vibrant research area that intersects computational geometry, combinatorial optimisation and algorithm design. Researchers are dedicated to ...

We design new approximation algorithms for the problems of optimizing submodular and supermodular functions subject to a single matroid constraint. Specifically, we consider the case in which we wish ...

Global optimisation stands as a pivotal discipline in applied mathematics and engineering, providing robust methodologies for determining the absolute best solution among myriad local optima. Recent ...

This course discusses basic convex analysis (convex sets, functions, and optimization problems), optimization theory (linear, quadratic, semidefinite, and geometric programming; optimality conditions ...