| The tree of hubs location problem I Contreras, E Fernández, A Marín European Journal of Operational Research 202 (2), 390-400, 2010 | 219 | 2010 |
| Solving large p-median problems with a radius formulation S García, M Labbé, A Marín INFORMS Journal on Computing 23 (4), 546-556, 2011 | 195 | 2011 |
| The return plant location problem: Modelling and resolution A Marin, B Pelegrín European journal of operational research 104 (2), 375-392, 1998 | 184 | 1998 |
| New formulations for the uncapacitated multiple allocation hub location problem A Marı́n, L Cánovas, M Landete European Journal of Operational Research 172 (1), 274-292, 2006 | 145 | 2006 |
| Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique L Cánovas, S García, A Marín European Journal of Operational Research 179 (3), 990-1007, 2007 | 126 | 2007 |
| Covering location problems S García, A Marín Location science, 93-114, 2015 | 120* | 2015 |
| Tight bounds from a path based formulation for the tree of hub location problem I Contreras, E Fernández, A Marín Computers & Operations Research 36 (12), 3117-3127, 2009 | 119 | 2009 |
| Formulating and solving splittable capacitated multiple allocation hub location problems A Marín Computers & operations research 32 (12), 3093-3109, 2005 | 118 | 2005 |
| A strengthened formulation for the simple plant location problem with order L Cánovas, S García, M Labbé, A Marín Operations Research Letters 35 (2), 141-150, 2007 | 117 | 2007 |
| A flexible model and efficient solution strategies for discrete location problems A Marín, S Nickel, J Puerto, S Velten Discrete Applied Mathematics 157 (5), 1128-1145, 2009 | 103 | 2009 |
| The discrete facility location problem with balanced allocation of customers A Marín European Journal of Operational Research 210 (1), 27-38, 2011 | 101 | 2011 |
| Closest assignment constraints in discrete location problems I Espejo, A Marín, AM Rodríguez-Chía European Journal of Operational Research 219 (1), 49-58, 2012 | 81 | 2012 |
| Applying Lagrangian relaxation to the resolution of two‐stage location problems A Marín, B Pelegrín Annals of Operations Research 86 (0), 179-198, 1999 | 72 | 1999 |
| Some personal views on the current state and the future of locational analysis P Avella, S Benati, LC Martinez, K Dalby, D Di Girolamo, B Dimitrijevic, ... European Journal of Operational Research 104 (2), 269-287, 1998 | 67 | 1998 |
| Uncapacitated Euclidean hub location: Strengthened formulation, new facets and a relax-and-cut algorithm A Marín Journal of Global Optimization 33, 393-422, 2005 | 65 | 2005 |
| An extended covering model for flexible discrete and equity location problems A Marín, S Nickel, S Velten Mathematical Methods of Operations Research 71, 125-163, 2010 | 64 | 2010 |
| A comparison of formulations and solution methods for the minimum-envy location problem I Espejo, A Marin, J Puerto, AM Rodríguez-Chía Computers & Operations Research 36 (6), 1966-1981, 2009 | 63 | 2009 |
| A branch-and-cut algorithm for the winner determination problem LF Escudero, M Landete, A Marín Decision Support Systems 46 (3), 649-659, 2009 | 57 | 2009 |
| New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem S García, M Landete, A Marín European Journal of Operational Research 220 (1), 48-57, 2012 | 56 | 2012 |
| On the facets of the simple plant location packing polytope L Cánovas, M Landete, A Marı́n Discrete Applied Mathematics 124 (1-3), 27-53, 2002 | 50 | 2002 |
