We present a probabilistic greedy search method for combinatorial optimisation problems. This approach is implemented and evaluated for the Set Covering Problem (SCP) and shown to yield a simple, ...

The set covering problem asks for the smallest collection of subsets whose union contains all elements in a given universe. As a canonical NP-hard challenge, it has inspired a rich array of exact, ...

Combinatorial optimisation for constraint problems encompasses a broad class of decision and optimisation tasks in which discrete choices must satisfy intricate side conditions. Typical examples ...