Abstract: Deterministic processing time are no longer applicable under realistic circumstances because of the uncertainties involved in manufacturing and production processes. The present study aims ...
Abstract: We present an optimal, combinatorial 1-1/e approximation algorithm for monotone sub modular optimization over a matroid constraint. Compared to the continuous greedy algorithm (Calinescu, ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results