1. Network flows: theory, algorithms and applications;Ahuja,1993
2. I. Aron, P. Van Hentenryck. A constraints satisfaction approach to the robust spanning tree problem with interval data, in: Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence (UAI), August 2002.
3. On the complexity of the robust spanning tree with interval data;Aron;Operations Research Letters,2003
4. On the complexity of a class of combinatorial optimization problems with uncertainty;Averbakh;Mathematical Programming,2001
5. Partitioning procedures for solving mixed integer variables programming problems;Benders;Numerische Mathematik,1962