1. Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, Englewood Cliffs
2. Altın A, Belotti P, Pınar M (2006) OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty. Technical report, Bilkent University
3. Altın A, Fortz B, Ümit H (2008) Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty. Technical report 588, ULB Computer Science Department, http://www.ulb.ac.be//di/publications/RT_2008.html
4. Altın A, Fortz B, Ümit H (2009) Oblivious OSPF routing with weight optimization under polyhedral uncertainty. In: Proceedings of the 3rd international network optimization conference (INOC 2009), Pisa, Italy
5. Applegate D, Cohen E (2003) Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In: SIGCOMM ’03: proceedings of the 2003 conference on applications, technologies, architectures, and protocols for computer communications, ACM, New York, NY, USA, pp 313–324, doi: 10.1145/863955.863991