This paper establishes some useful properties of the equality-constrained setcovering problem P and the associated linear program P′. First, the Dantzig property of transportation matrices is shown to ...
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, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback