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 | 128 | 2013 |

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 | 83 | 2001 |

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 | 79 | 2006 |

Genetic algorithm for the topological design of survivable optical transport networks R Morais, C Pavan, A Pinto, C Requejo IEEE/OSA Journal of Optical Communications and Networking 3 (1), 17-26, 2010 | 45 | 2010 |

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 | 44 | 2004 |

Layered formulation for the robust vehicle routing problem with time windows A Agra, M Christiansen, R Figueiredo, LM Hvattum, M Poss, C Requejo International Symposium on Combinatorial Optimization, 249-260, 2012 | 31 | 2012 |

Greedy heuristics for the diameter-constrained minimum spanning tree problem C Requejo, E Santos Journal of mathematical sciences 161 (6), 930-943, 2009 | 12 | 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 (1), 19-39, 2006 | 12 | 2006 |

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, 75-96, 1998 | 11 | 1998 |

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 | 9 | 2017 |

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 | 8 | 2017 |

Formulations for the Weight‐Constrained Minimum Spanning Tree Problem C Requejo, A Agra, A Cerveira, E Santos AIP Conference Proceedings 1281 (1), 2166-2169, 2010 | 8 | 2010 |

The linking set problem: a polynomial special case of the multiple-choice knapsack problem A Agra, C Requejo Journal of Mathematical Sciences 161 (6), 919-929, 2009 | 8 | 2009 |

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 | 5 | 2018 |

On the weight-constrained minimum spanning tree problem A Agra, A Cerveira, C Requejo, E Santos International Conference on Network Optimization, 156-161, 2011 | 5 | 2011 |

Using decomposition to improve greedy solutions of the optimal diversity management problem A Agra, JO Cerdeira, C Requejo International Transactions in Operational Research 20 (5), 617-625, 2013 | 4 | 2013 |

Lagrangean based algorithms for the weight-constrained minimum spanning tree problem C Requejo, E Santos Agra, Agostinho and Doostmohammadi, Mahdi (2011) A Polyhedral Study of Mixed …, 2011 | 4 | 2011 |

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 | 3 | 2018 |

A feasibility pump and a local branching heuristics for the weight-constrained minimum spanning tree problem C Requejo, E Santos International Conference on Computational Science and Its Applications, 669-683, 2017 | 3 | 2017 |

Implicit cover inequalities A Agra, C Requejo, E Santos Journal of Combinatorial Optimization 31 (3), 1111-1129, 2016 | 3 | 2016 |