| The robust vehicle routing problem with time windows A Agra, M Christiansen, R Figueiredo, LM Hvattum, M Poss, C Requejo Computers & operations research 40 (3), 856-866, 2013 | 257 | 2013 |
| On formulations and methods for the hop-constrained minimum spanning tree problem G Dahl, L Gouveia, C Requejo Handbook of optimization in telecommunications, 493-515, 2006 | 98 | 2006 |
| A new lagrangean relaxation approach for the hop-constrained minimum spanning tree problem L Gouveia, C Requejo European Journal of Operational Research 132 (3), 539-552, 2001 | 96 | 2001 |
| Genetic algorithm for the topological design of survivable optical transport networks RM Morais, C Pavan, AN Pinto, C Requejo Journal of optical communications and networking 3 (1), 17-26, 2010 | 71 | 2010 |
| Layered formulation for the robust vehicle routing problem with time windows A Agra, M Christiansen, R Figueiredo, L Magnus Hvattum, M Poss, ... Combinatorial Optimization: Second International Symposium, ISCO 2012 …, 2012 | 50 | 2012 |
| A 2‐path approach for odd‐diameter‐constrained minimum spanning and Steiner trees L Gouveia, TL Magnanti, C Requejo Networks: An International Journal 44 (4), 254-265, 2004 | 48 | 2004 |
| Comparing techniques for modelling uncertainty in a maritime inventory routing problem F Rodrigues, A Agra, M Christiansen, LM Hvattum, C Requejo European Journal of Operational Research 277 (3), 831-845, 2019 | 45 | 2019 |
| An adjustable sample average approximation algorithm for the stochastic production‐inventory‐routing problem A Agra, C Requejo, F Rodrigues Networks 72 (1), 5-24, 2018 | 28 | 2018 |
| Temporal constraints and device management for the Skill VRP: mathematical model and lower bounding techniques P Cappanera, C Requejo, MG Scutellà Computers & Operations Research 124, 105054, 2020 | 25 | 2020 |
| A hybrid heuristic for a stochastic production-inventory-routing problem A Agra, C Requejo, F Rodrigues Electronic Notes in Discrete Mathematics 64, 345-354, 2018 | 19 | 2018 |
| A block active set algorithm for large-scalequadratic programming with box constraints L Fernandes, A Fischer, J Júdice, C Requejo, J Soares Annals of Operations research 81 (0), 75-96, 1998 | 17 | 1998 |
| Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problem F Rodrigues, A Agra, C Requejo, E Delage INFORMS Journal on Computing 33 (2), 685-705, 2021 | 16 | 2021 |
| Compact mixed integer linear programming models to the minimum weighted tree reconstruction problem B Fortz, O Oliveira, C Requejo European journal of operational research 256 (1), 242-251, 2017 | 16 | 2017 |
| Greedy heuristics for the diameter-constrained minimum spanning tree problem C Requejo, E Santos Journal of mathematical sciences 161, 930-943, 2009 | 15 | 2009 |
| The linking set problem: a polynomial special case of the multiple-choice knapsack problem A Agra, C Requejo Journal of Mathematical Sciences 161, 919-929, 2009 | 14 | 2009 |
| An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees L Gouveia, TL Magnanti, C Requejo Annals of Operations Research 146, 19-39, 2006 | 14 | 2006 |
| A decomposition approach for the p-median problem on disconnected graphs A Agra, JO Cerdeira, C Requejo Computers & Operations Research 86, 79-85, 2017 | 11 | 2017 |
| Feasibility check for the distance geometry problem: an application to molecular conformations A Agra, R Figueiredo, C Lavor, N Maculan, A Pereira, C Requejo International Transactions in Operational Research 24 (5), 1023-1040, 2017 | 11 | 2017 |
| Lagrangian relaxation bounds for a production-inventory-routing problem A Agra, A Cerveira, C Requejo Machine Learning, Optimization, and Big Data: Second International Workshop …, 2016 | 10 | 2016 |
| A computational comparison of compact MILP formulations for the zero forcing number A Agra, JO Cerdeira, C Requejo Discrete Applied Mathematics 269, 169-183, 2019 | 8 | 2019 |
Agostinho AgraUniversity of AveiroBestätigte E-Mail-Adresse bei ua.pt
