158 citations · 513 across the 30 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
cs.DS2010★ 64 cited
Efficient Local Search Algorithms for Known and New Neighborhoods for the Generalized Traveling Salesman Problem
Daniel Karapetyan, Gregory Gutin
The Generalized Traveling Salesman Problem (GTSP) is a well-known combinatorial optimization problem with a host of applications. It is an extension of the Traveling Salesman Probl…
cs.DS2010★ 12 cited
A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem
Daniel Karapetyan, Gregory Gutin
Memetic Algorithms are known to be a powerful technique in solving hard optimization problems. To design a memetic algorithm one needs to make a host of decisions; selecting a popu…
cs.DS2010★ 100 cited
Lin-Kernighan Heuristic Adaptations for the Generalized Traveling Salesman Problem
Daniel Karapetyan, Gregory Gutin
The Lin-Kernighan heuristic is known to be one of the most successful heuristics for the Traveling Salesman Problem (TSP). It has also proven its efficiency in application to some…