Time‐dependent traveling salesman problem–the deliveryman case A Lucena Networks 20 (6), 753-763, 1990 | 141 | 1990 |

Strong lower bounds for the prize collecting Steiner problem in graphs A Lucena, MGC Resende Discrete Applied Mathematics 141 (1-3), 277-294, 2004 | 98 | 2004 |

A new formulation for the traveling deliveryman problem I Méndez-Díaz, P Zabala, A Lucena Discrete Applied Mathematics 156 (17), 3223-3237, 2008 | 86 | 2008 |

Steiner problem in graphs: Lagrangean relaxation and cutting planes A Lucena Coal Bulletin 21 (2), 2-8, 1992 | 84 | 1992 |

Non delayed relax-and-cut algorithms A Lucena Annals of Operations Research 140 (1), 375-410, 2005 | 65 | 2005 |

Scheduling examinations to reduce second-order conflicts N Balakrishnan, A Lucena, RT Wong Computers & Operations Research 19 (5), 353-361, 1992 | 62 | 1992 |

A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs AS da Cunha, A Lucena, N Maculan, MGC Resende Discrete Applied Mathematics 157 (6), 1198-1217, 2009 | 59 | 2009 |

Stronger k-tree relaxations for the vehicle routing problem C Martinhon, A Lucena, N Maculan European Journal of Operational Research 158 (1), 56-71, 2004 | 59 | 2004 |

A branch and cut algorithm for the Steiner problem in graphs A Lucena, JE Beasley Networks: An International Journal 31 (1), 39-59, 1998 | 59 | 1998 |

Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem B Gendron, A Lucena, AS da Cunha, L Simonetti INFORMS Journal on Computing 26 (4), 645-657, 2014 | 51 | 2014 |

Tight bounds for the Steiner problem in graphs A Lucena Preprint, IRC for Process Systems Engineering, Imperial College, London, 1993 | 48 | 1993 |

Reformulations and solution algorithms for the maximum leaf spanning tree problem A Lucena, N Maculan, L Simonetti Computational Management Science 7 (3), 289-311, 2010 | 45 | 2010 |

Solving diameter constrained minimum spanning tree problems in dense graphs AC dos Santos, A Lucena, CC Ribeiro International Workshop on Experimental and Efficient Algorithms, 458-467, 2004 | 45 | 2004 |

Using Lagrangian dual information to generate degree constrained spanning trees R Andrade, A Lucena, N Maculan Discrete Applied Mathematics 154 (5), 703-717, 2006 | 43 | 2006 |

The minimum connected dominating set problem: Formulation, valid inequalities and a branch-and-cut algorithm L Simonetti, AS Da Cunha, A Lucena International Conference on Network Optimization, 162-169, 2011 | 40 | 2011 |

Optimal rectangular partitions FC Calheiros, A Lucena, CC De Souza Networks: An International Journal 41 (1), 51-67, 2003 | 40 | 2003 |

Branch and cut algorithms A Lucena, JE Beasley Advances in linear and integer programming 4, 187-221, 1996 | 35 | 1996 |

Lower and upper bounds for the degree‐constrained minimum spanning tree problem AS da Cunha, A Lucena Networks: An International Journal 50 (1), 55-66, 2007 | 31 | 2007 |

A hybrid heuristic for the diameter constrained minimum spanning tree problem A Lucena, CC Ribeiro, AC Santos Journal of global optimization 46 (3), 363-381, 2010 | 26 | 2010 |

The k-cardinality tree problem: reformulations and lagrangian relaxation FP Quintão, AS da Cunha, GR Mateus, A Lucena Discrete Applied Mathematics 158 (12), 1305-1314, 2010 | 23 | 2010 |