News

Distributed Constraint Optimisation and Search Algorithms form a vital framework for addressing complex decision‐making and scheduling problems in multi-agent systems.
In the present paper a bi-objective integer linear programming problem (BILP) is discussed. The main effort in this work is to effectively implement the ϵ-constraint method to produce a complete set ...
Mathematical programming with vanishing constraints (MPVC) represents a challenging class of optimisation problems where certain constraints become inactive—or “vanish”—depending on ...
General constraints are relaxed by a nonlinear penalty function for which the corresponding dual problem has weak and strong duality. The relaxed problem is attacked by a genetic algorithm with ...
M.Sc. Paul Saikko defends his doctoral thesis Implicit Hitting Set Algorithms for Constraint Optimization on Monday the 2nd of December 2019 at 12 o'clock noon in the University of Helsinki Exactum ...