On the complexity of a class of combinatorial optimization problems with uncertainty

Igor Averbakh. On the complexity of a class of combinatorial optimization problems with uncertainty. Math. Program., 90(2):263-272, 2001. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.