1. Aissi, H., Bazgan, C., Vanderpooten, D.: Complexity of the minmax and minmax regret assignment problems. OR Lett. 33(6), 634–640 (2005)
2. Aron, I.D., Van Hentenryck, P.: On the complexity of the robust spanning tree problem with interval data. OR Lett. 32(1), 36–40 (2004)
3. Benabbou, N., Perny, P.: Incremental weight elicitation for multiobjective state space search. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, pp. 1093–1099 (2015)
4. Boutilier, C., Patrascu, R., Poupart, P., Schuurmans, D.: Constraint-based optimization and utility elicitation using the minimax decision criterion. Artif. Intell. 170(8–9), 686–713 (2006)
5. Deı, V.G., Woeginger, G.J.: On the robust assignment problem under a fixed number of cost scenarios. OR Lett. 34(2), 175–179 (2006)