| Digraphs: theory, algorithms and applications J Bang-Jensen, GZ Gutin Springer Science & Business Media, 2008 | 2886 | 2008 |
| The traveling salesman problem and its variations G Gutin, AP Punnen Springer Science & Business Media, 2006 | 1723 | 2006 |
| Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP G Gutin, A Yeo, A Zverovich Discrete Applied Mathematics 117 (1-3), 81-86, 2002 | 320 | 2002 |
| When the greedy algorithm fails J Bang-Jensen, G Gutin, A Yeo Discrete optimization 1 (2), 121-127, 2004 | 157 | 2004 |
| Construction heuristics for the asymmetric TSP F Glover, G Gutin, A Yeo, A Zverovich European Journal of Operational Research 129 (3), 555-568, 2001 | 135 | 2001 |
| A memetic algorithm for the generalized traveling salesman problem G Gutin, D Karapetyan Natural Computing 9 (1), 47-60, 2010 | 126 | 2010 |
| Solving MAX-r-SAT above a tight lower bound N Alon, G Gutin, EJ Kim, S Szeider, A Yeo Algorithmica 61 (3), 638-655, 2011 | 119 | 2011 |
| Cycles and paths in semicomplete multipartite digraphs, theorems, and algorithms: a survey G Gutin Journal of Graph Theory 19 (4), 481-505, 1995 | 105 | 1995 |
| Lin–Kernighan heuristic adaptations for the generalized traveling salesman problem D Karapetyan, G Gutin European Journal of Operational Research 208 (3), 221-232, 2011 | 99 | 2011 |
| A characterization of horizontal visibility graphs and combinatorics on words G Gutin, T Mansour, S Severini Physica A: Statistical Mechanics and its Applications 390 (12), 2421-2428, 2011 | 93 | 2011 |
| Level of repair analysis and minimum cost homomorphisms of graphs G Gutin, A Rafiey, A Yeo, M Tso Discrete applied mathematics 154 (6), 881-889, 2006 | 91 | 2006 |
| Alternating cycles and paths in edge-coloured multigraphs: a survey J Bang-Jensen, G Gutin Discrete Mathematics 165, 39-60, 1997 | 84 | 1997 |
| Generalizations of tournaments: A survey J Bang–Jensen, G Gutin Journal of Graph Theory 28 (4), 171-202, 1998 | 82 | 1998 |
| Exponential neighborhoods and domination analysis for the TSP G Gutin, A Yeo, A Zverovitch The traveling salesman problem and its variations, 223-256, 2007 | 80 | 2007 |
| Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number G Gutin, A Yeo Discrete Applied Mathematics 119 (1-2), 107-116, 2002 | 79 | 2002 |
| An approximate algorithm for combinatorial optimization problems with two parameters D Blokh, G Gutin Australasian Journal of Combinatorics 14, 157-164, 1996 | 78 | 1996 |
| A classification of locally semicomplete digraphs J Bang-Jensen, Y Guo, G Gutin, L Volkmann Discrete Mathematics 167, 101-114, 1997 | 77 | 1997 |
| Exponential neighbourhood local search for the traveling salesman problem G Gutin Computers & Operations Research 26 (4), 313-320, 1999 | 74 | 1999 |
| Transformations of generalized ATSP into ATSP D Ben-Arieh, G Gutin, M Penn, A Yeo, A Zverovitch Operations Research Letters 31 (5), 357-365, 2003 | 71 | 2003 |
| Properly colored Hamilton cycles in edge‐colored complete graphs N Alon, G Gutin Random Structures & Algorithms 11 (2), 179-186, 1997 | 64 | 1997 |
Dave CohenProfessor of Computer Science, Royal Holloway, University of LondonGeverifieerd e-mailadres voor rhul.ac.uk
