Memetic Algorithms for the Traveling Salesman Problem

First Page		Document Content
Date: 2012-09-20 14:36:39 Travelling salesman problem Mathematical optimization Operations research Cybernetics Genetic algorithms Memetic algorithm Lin–Kernighan heuristic Greedy algorithm Christofides algorithm Mathematics Applied mathematics Theoretical computer science		Memetic Algorithms for the Traveling Salesman Problem Add to Reading List Source URL: www.complex-systems.com Download Document from Source Website File Size: 1,76 MB Share Document on Facebook

	FINDING HAMILTON CYCLES IN ROBUSTLY EXPANDING DIGRAPHS ¨ DEMETRES CHRISTOFIDES, PETER KEEVASH, DANIELA KUHN AND DERYK OSTHUS Abstract. We provide an NC algorithm for finding Hamilton cycles in directed graphs DocID: 1n6tO - View Document
	Design and Analysis of Algorithms CS681 Fall 2007 Christofides’s Algorithm Sunday, October 28, 2007 DocID: 1mquF - View Document
	Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772) DocID: 18Med - View Document
	Memetic Algorithms for the Traveling Salesman Problem DocID: 18F7U - View Document
	Design and Analysis of Algorithms CS681 Fall 2007 DocID: 4FC6 - View Document