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 Journal of the Operational Research Society, Vol. 48, No. 8 (Aug., 1997), pp. 804-809 (6 pages) A new algorithm for the generalised assignment problem is described in this paper. The algorithm is ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results