1. Agarwal, Y. K. (2006). k-Partition-based facets of the network design problem. Networks, 47(3), 123–139.
2. Altin, A., Amaldi, E., Belotti, P., & Pinar, M. Ç. (2007). Provisioning virtual private networks under traffic uncertainty. Networks, 49(1), 100–155.
3. Altin, A., Yaman, H., & Pinar, M. (2011). The robust network loading problem under hose demand uncertainty: formulation, polyhedral analysis, and computations. INFORMS Journal on Computing, 23(1), 75–89.
4. Álvarez-Miranda, E., Cacchiani, V., Dorneth, T., Jünger, M., Liers, F., Lodi, A., et al. (2012). Models and algorithms for robust network design with several traffic scenarios. In A. Ridha Mahjoub, V. Markakis, I. Milis, & V. T. Paschos (Eds.), ISCO 2012, Revised Selected Papers. Lecture notes in computer science (vol. 7422, pp. 261–272). Springer.
5. Atamtürk, A., & Zhang, M. (2007). Two-stage robust network flow and design under demand uncertainty. Operations Research, 55(4), 662–673.