1. I. Aron, P. Van Hentenryck, A constraint satisfaction approach to the robust spanning tree with interval data, in: Proc. 18th Conf. on Uncertainty in Artificial Intelligence, Edmonton, Canada, August 2002
2. On the complexity of the robust spanning tree with interval data;Aron;Oper. Res. Lett.,2004
3. On the complexity of a class of combinatorial optimization problems with uncertainty;Averbakh;Math. Program., Ser. A,2001
4. Interval data minmax regret network optimization problems;Averbakh;Discrete Appl. Math.,2004
5. A. Kasperski, P. Zieliński, Minimizing maximal regret in linear assignment problems with interval data, Instytut Matematyki PWr., Wroclaw 2004, Raport serii PREPRINTY nr. 007