1. Ajili, F., Rodosek, R., Eremin, A.: A branch-price-and-propagate approach for optimising IGP weight setting subject to unique shortest paths. In: Proceedings of the 20th Annual ACM Symposium on Applied Computing (ACM SAC 2005), Santa Fe, New Mexico (March 2005)
2. Ajili, F., Rodosek, R., Eremin, A.: A scalable tabu search algorithm for optimising IGP routing. In: 2nd International Network Optimization Conference (INOC 2005), pp. 348–354 (March 2005)
3. Cao, J., Davis, D., Vander Weil, S., Yu, B.: Time-varying network tomography. Journal of the American Statistical Association (2000)
4. Castro, R., Coates, M., Liang, G., Nowak, R., Yu, B.: Network tomography: Recent developments (2003)
5. Chabrier, A.: Heuristic branch-and-price-and-cut to solve a network design problem. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems CP-AI-OR 2003, Montreal, Canada (May 2003)