Subgrafo Candidato
Subgrafo Candidato
Subgrafo Candidato
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Referencias<br />
Jünger, M., Reinelt, G. y Rinaldi, G. (1995), “The Traveling Salesman<br />
Problem", En: Ball, M.O., Magnanti, T.L., Monma, C.L. y Nemhauser,<br />
G.L. (eds.), Handbook in Operations Research and Management<br />
Science, Vol. 7, Network Models, pág 225--330. North-Holland,<br />
Amsterdam.<br />
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G. y Shmoys, D.B. (eds.)<br />
(1985), The Traveling Salesman Problem. A Guided Tour to<br />
Combinatorial Optimization, John Wiley and Sons, Chichester.<br />
Reinelt, G. (1991), “TSPLIB - A Traveling Salesman Problem Library”,<br />
ORSA Journal on Computing 3, 376-384.<br />
Reeves, C.R. (1995), Modern Heuristic Techniques for Combinatorial<br />
Problems, McGraw-Hill, UK.<br />
Feo, T. and Resende, M.G.C. (1995), “Greedy Randomized Adaptive<br />
Search Procedures”, Journal of Global Optimization, 2, 1-27.<br />
37. R. Martí. Universidad de Valencia.
Change language