| Evaluating passenger robustness in a rail transit network A De-Los-Santos, G Laporte, JA Mesa, F Perea Transportation Research Part C: Emerging Technologies 20 (1), 34-46, 2012 | 123 | 2012 |
| A game theoretic framework for the robust railway transit network design problem G Laporte, JA Mesa, F Perea Transportation Research Part B: Methodological 44 (4), 447-459, 2010 | 82 | 2010 |
| Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources L Fanjul-Peyro, F Perea, R Ruiz European Journal of Operational Research 260 (2), 482-493, 2017 | 74 | 2017 |
| Designing robust rapid transit networks with alternative routes G Laporte, A Marin, JA Mesa, F Perea Journal of advanced transportation 45 (1), 54-65, 2011 | 65 | 2011 |
| Planning rapid transit networks G Laporte, JA Mesa, FA Ortega, F Perea Socio-Economic Planning Sciences 45 (3), 95-104, 2011 | 64 | 2011 |
| Revisiting a game theoretic framework for the robust railway network design against intentional attacks F Perea, J Puerto European Journal of Operational Research 226 (2), 286-292, 2013 | 38 | 2013 |
| Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times L Fanjul-Peyro, R Ruiz, F Perea Computers & Operations Research 101, 173-182, 2019 | 27 | 2019 |
| Modeling cooperation on a class of distribution problems F Perea, J Puerto, FR Fernández European Journal of Operational Research 198 (3), 726-733, 2009 | 25 | 2009 |
| Finding the nucleolus of any n-person cooperative game by a single linear program J Puerto, F Perea Computers & Operations Research 40 (10), 2308-2313, 2013 | 23 | 2013 |
| Integrating robust railway network design and line planning under failures Á Marín, JA Mesa, F Perea Robust and online large-scale optimization, 273-292, 2009 | 21 | 2009 |
| Greedy and K-Greedy algorithms for Multidimensional Data Association F Perea, HW De Waard Aerospace and Electronic Systems, IEEE Transactions on 47 (3), 1915-1925, 2011 | 20* | 2011 |
| GRASP algorithms for the robust railway network design problem B García-Archilla, AJ Lozano, JA Mesa, F Perea Journal of Heuristics 19 (2), 399-422, 2013 | 17 | 2013 |
| Resolution of an Antenna–Satellite assignment problem by means of Integer Linear Programming R Vazquez, F Perea, JG Vioque Aerospace Science and Technology 39, 567-574, 2014 | 16 | 2014 |
| A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments MC Körner, JA Mesa, F Perea, A Schöbel, D Scholz Top 22 (1), 227-253, 2014 | 16 | 2014 |
| Swath-acquisition planning in multiple-satellite missions: an exact and heuristic approach F Perea, R Vazquez, J Galan-Viogue IEEE Transactions on Aerospace and Electronic Systems 51 (3), 1717-1725, 2015 | 14 | 2015 |
| Management Mathematics for european schools PL Barreiro, FP Rojas-Marcos, JP Albandoz VIII Journées Zaragoza-Pau de Mathématiques Appliquées et de Statistiques …, 2003 | 13* | 2003 |
| Greedy and K-Greedy algorithms for the Multi Target Tracking and Data Association Problem F Perea, HW de Waard | 13* | |
| A cooperative location game based on the 1-center location problem J Puerto, A Tamir, F Perea European Journal of Operational Research 214 (2), 317-330, 2011 | 12 | 2011 |
| Dynamic programming analysis of the TV game “Who wants to be a millionaire?” F Perea, J Puerto European journal of operational research 183 (2), 805-811, 2007 | 12 | 2007 |
| Adding a new station and a road link to a road–rail network in the presence of modal competition F Perea, JA Mesa, G Laporte Transportation Research Part B: Methodological 68, 1-16, 2014 | 11 | 2014 |
Justo PuertoUniversidad de SevillaVerified email at us.es
