This implements an abstract version of the default greedy algorithm for reduced basis and empirical interpolation basis generation. The actual implementation of the ...

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

This is a preview. Log in through your library . Abstract A greedy algorithm solves a dual pair of linear programs where the primal variables are associated to the elements of a sublattice B of a ...