P. Moscato and F. Tinetti, \Blending Heuristics with a Populationbased Approach: A Memetic Algorithm for the Traveling Salesman Problem," Technical Report CeTAD, (CeTAD, Universitad Nacional de La Plata, 1994). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Memetic Algorithms for the Traveling Salesman Problem - Merz, Freisleben (1997) (Correct)
No context found.
P. Moscato and F. Tinetti, \Blending Heuristics with a Populationbased Approach: A Memetic Algorithm for the Traveling Salesman Problem," Technical Report CeTAD, (CeTAD, Universitad Nacional de La Plata, 1994).
Solving the Rural Postman Problem by Memetic Algorithms - Rodrigues, Ferreira (2001) (Correct)
No context found.
Pablo Moscato and Fernando Tinetti. Blending Heuristics with a Population-Based Approach: A "Memetic" Algorithm for the Traveling Salesman Problem. R.Rep.: Universidad Nacional de La Plata, 1994.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC