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

The stochastic root-finding problem is that of finding a zero of a vector-valued function known only through a stochastic simulation. The simulation-optimization problem is that of locating a ...

This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...

Multi-objective optimisation using evolutionary algorithms constitutes a powerful computational framework that addresses complex problems involving conflicting objectives. By emulating natural ...

June 5, 2024 — In a new paper in Science Advances on May 29, researchers at JPMorgan Chase, the U.S. Department of Energy’s (DOE) Argonne National Laboratory and Quantinuum have demonstrated clear ...