1. I.D. Aron, P. van Hentenryck, A constraint satisfaction approach to the robust spanning tree problem with interval data, in: Proc. 18th Conf. on Uncertainty in Artificial Intelligence, Edmonton, Canada, August 2002, pp. 18–25.
2. The computational complexity of the criticality problems in a network with interval activity times;Chanas;European Journal of Operational Research,2002
3. Introduction to Algorithms;Cormen,1994
4. D. Dubois, H. Fargier, J. Fortin, A generalized vertex method for computing with fuzzy intervals, in: Proc. IEEE Internat. Conf. on Fuzzy Systems, Reno, Nevada, 2004, pp. 541–546.
5. Possibility Theory: An Approach to Computerized Processing of Uncertainty;Dubois,1988