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

Optimization problems with partial differential equations as constraints arise widely in many areas of science and engineering, in particular in problems of the design. The solution of such class of ...

Sequential optimality conditions for constrained optimization are necessarily satisfied by local minimizers, independently of the fulfillment of constraint qualifications. These conditions support the ...

On Monday the 2nd of December 2019, M.Sc. Paul Saikko will defend his doctoral thesis on Implicit Hitting Set Algorithms for Constraint Optimization. The thesis is a part of research done in the ...

FSNet is a new problem-solving tool that can find the optimal solution to an extremely complex problem without violating any of the problem’s many constraints. Developed at MIT, FSNet could help power ...

The Constraint Reasoning and Optimization group invites applications for a 2019 summer internship in the group from talented and motivated computer science and math students. Are you interested in ...