Particle Swarm Optimization (PSO) has emerged as a versatile metaheuristic for tackling NP-hard combinatorial optimisation challenges by emulating the collective intelligence of social organisms. In ...

Combinatorial optimisation addresses the search for optimal configurations within discrete, often high‐dimensional spaces, where the number of feasible solutions grows exponentially with problem size.

In this graduate-level course, we will be covering advanced topics in combinatorial optimization. We will start with matchings and cover many results, extending the fundamental results of matchings, ...

The traveling salesman problem is considered a prime example of a combinatorial optimization problem. Now a Berlin team led by theoretical physicist Prof. Dr. Jens Eisert of Freie Universität Berlin ...

A line of engineering research seeks to develop computers that can tackle a class of challenges called combinatorial optimization problems. These are common in real-world applications such as ...

Although computers are overwhelmingly digital today, there’s a good point to be made that analog computers are the more efficient approach for specific applications. The authors behind a recent paper ...

We are pleased to announce that Gabriele Fici will visit CWI, Amsterdam to give a 2-week hybrid course on Combinatorics on Words, from 15 to 25 April 2024. Organisation: The course will be from ...

A framework based on advanced AI techniques can solve complex, computationally intensive problems faster and in a more more scalable way than state-of-the-art methods, according to a new study. A ...

This course is available on the MSc in Mathematics and Computation and MSc in Operations Research & Analytics. This course is not available as an outside option to students on other programmes. This ...