Certainty Closure: On Tackling Combinatorial Optimisation Problems with Uncertain Data (CERCLe)

EPSRC

The research focuses on ill-defined large scale combinatorial optimization problems with partial or incomplete data within a constraint programming environment. The aim is to provide a generic system that considers all three aspects: the computation domain (how to represent ill-defined data), the semantics (how to characterize formally the constraints and decision criteria), and the algorithms (how to infer consistency and compute solutions).