Distributed Constraint Optimisation and Search Algorithms form a vital framework for addressing complex decision‐making and scheduling problems in multi-agent systems. These algorithms ...

Implicit Hitting Set Algorithms for Constraint Optimization Computationally hard optimization problems are commonplace not only in theory but also in practice in many real-world domains. Even ...

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 ...

We focus on a particular generic framework for solving constraint optimization problems, the so-called implicit hitting set (IHS) approach. The approach is based on a theory of duality between ...

The researchers also considered an extension of the STSP that includes time windows for simultaneous pickups and deliveries, creating a more realistic and challenging problem. The core method involves ...