Davide Cherubini - PhD Thesis - UniCA Eprints

REFERENCES[28] L. S. Buriol, M. G. C. Resende, and M. Thorup. Survivable IPnetwork design with OSPF routing. Networks, 49(1):51–64, 2007. 17[29] V. Cerny. A thermodynamical approach to the traveling salesman problem:an efficient simulation algorithm. Optimization Theory and Appl., 45:41–51,1985. 22[30] T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction toAlgorithms. MIT Press, 1990. 47[31] G. B. Dantzig. Linear Programming and Extensions. Princeton UniversityPress, Princeton, 1963. 43[32] Edsger W. Dijkstra. A note on two problem in connexion with graphs.Numerische Mathematik, 1:269–271, 1959. 5, 49[33] M. Dorigo and G. Di Caro. New Ideas in Optimization: The Ant ColonyOptimization Meta-Heuristic. pages 11–32. McGraw-Hill, 1999. 24[34] Marco Dorigo. Optimization, learning and natural algorithms. PhD thesis,Dipartimento di Elettronica, Politecnico di Milano, Milan, 1992. 24[35] Marco Dorigo and Thomas Stützle. Ant Colony Optimization. TheMIT Press, 2004. 24[36] U. Killat E. Mulyana. A Hybrid Genetic Algorithm Approach for OSPFWeight Setting Problem. In Peroc. of the 2 nd Polish-German TeletrafficSymposium PGTS, 2004. 15[37] J. Edmonds and R.M. Karp. Theoretical improvements in algorithmicefficiency for network flow problems. J. ACM, 19(2):248–264, 1972. 47[38] A. Elwalid, C. Jin, S. H. Low, and I. Widjaja. MATE: MPLS adaptivetraffic engineering. In INFOCOM, pages 1300–1309, 2001. 16[39] S. Cerav Erbas and C. Erbas. A multiobjective off-line routing modelfor MPLS networks. In Proc. of the 18th International Teletraffic Congress,2003. 1687