Combinatorial optimisation is a fundamental field in applied mathematics and computer science that focuses on finding an optimal object from a finite set of objects. In this context, problems are ...

Combinatorial optimisation algorithms are central to addressing problems in which the goal is to select an optimal solution from a finite set of alternatives.

When dress becomes a public debate. In May 2025, the experience of Alejandra Carreño, an employee at a California public housing association, reignited the debate on gendered dress codes.

The 21st Conference on Integer Programming and Combinatorial Optimization (IPCO XXI) took place online on June 8-10. The conference was preceded by an online Summer School on June 6-7. The conference ...

Intelligent Transportation Systems (ITS) occupy a pivotal position in the contemporary societal landscape, with one of their widespread applications being the vehicle routing problem, renowned for its ...

The branch-and-bound efficiency depends on how close to the optimal solution are the bounds of the sub-problems. Thus, we propose a combinatorial relaxation algorithm that can be used at each node of ...

We define a graph-based rate optimization problem and consider its computation, which provides a unified approach to the computation of various theoretical limits, including the (conditional) graph ...