| A branch-and-cut algorithm for the symmetric generalized traveling salesman problem M Fischetti, JJ Salazar González, P Toth Operations Research 45 (3), 378-394, 1997 | 622 | 1997 |
| Solving the orienteering problem through branch-and-cut M Fischetti, JJ Salazar-Gonzalez, P Toth INFORMS Journal on Computing 10 (2), 133-148, 1998 | 455 | 1998 |
| An exact approach for capacitated vehicle routing problems with two-dimensional loading constraints M Iori, JJ Salazar González, D Vigo Transportation Science 41 (2), 253-264, 2007 | 381 | 2007 |
| A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery H Hernández-Pérez, JJ Salazar-González Discrete Applied Mathematics 145 (1), 126-139, 2004 | 341 | 2004 |
| Statistical Confidentiality: Principles and Practice GT Duncan, M Elliot, JJ Salazar-González Springer New York, 2011 | 288* | 2011 |
| The ring star problem: Polyhedral analysis and exact algorithm M Labbé, G Laporte, I Rodríguez Martín, JJ Salazar González Networks 43 (3), 177-189, 2004 | 230 | 2004 |
| Heuristics for the one-commodity pickup-and-delivery traveling salesman problem H Hernández-Pérez, JJ Salazar-González Transportation Science 38 (2), 245-255, 2004 | 214 | 2004 |
| The capacitated m-ring-star problem R Baldacci, M Dell'Amico, JJ Salazar González Operations Research 55 (6), 1147-1162, 2007 | 193 | 2007 |
| The symmetric generalized traveling salesman polytope M Fischetti, JJ Salazar González, P Toth Networks 26 (2), 113-123, 1995 | 180 | 1995 |
| Projection results for vehicle routing AN Letchford, JJ Salazar-González Mathematical Programming 105 (2), 251-274, 2006 | 176 | 2006 |
| Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch-and-cut approach J Riera-Ledesma, JJ Salazar-Gonzalez Computers & Operations Research 39 (2), 391-404, 2012 | 166 | 2012 |
| A branch-and-cut algorithm for the hub location and routing problem I Rodríguez-Martín, JJ Salazar-González, H Yaman Computers & Operations Research 50, 161-174, 2014 | 146 | 2014 |
| A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading JF Cordeau, M Iori, G Laporte, JJ Salazar González Networks 55 (1), 46-59, 2010 | 139 | 2010 |
| The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms H Hernández‐Pérez, JJ Salazar‐González Networks: An International Journal 50 (4), 258-272, 2007 | 138 | 2007 |
| Solving a capacitated hub location problem I Rodriguez-Martin, JJ Salazar-Gonzalez European Journal of Operational Research 184 (2), 468-479, 2008 | 135 | 2008 |
| The generalized traveling salesman and orienteering problems M Fischetti, JJ Salazar-González, P Toth The traveling salesman problem and its variations 12, 609-662, 2007 | 134 | 2007 |
| Approaches to solve the fleet-assignment, aircraft-routing, crew-pairing and crew-rostering problems of a regional carrier JJ Salazar-González Omega 43, 71-82, 2014 | 130 | 2014 |
| A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem H Hernández-Pérez, I Rodríguez-Martín, JJ Salazar-González Computers & Operations Research 36 (5), 1639-1645, 2009 | 130 | 2009 |
| A branch-and-cut algorithm for the undirected traveling purchaser problem G Laporte, J Riera-Ledesma, JJ Salazar-González Operations Research 51 (6), 940-951, 2003 | 124 | 2003 |
| Locating median cycles in networks M Labbé, G Laporte, I Rodrı́guez Martı́n, JJ Salazar González European Journal of Operational Research 160 (2), 457-470, 2005 | 123 | 2005 |
Inmaculada Rodríguez-MartínUniversidad de La Laguna, SpainVerified email at ull.edu.es
