| Optimally solving the joint order batching and picker routing problem CA Valle, JE Beasley, AS Da Cunha European Journal of Operational Research 262 (3), 817-834, 2017 | 117 | 2017 |
| The pickup and delivery problem with cross-docking FA Santos, GR Mateus, AS Da Cunha Computers & Operations Research 40 (4), 1085-1093, 2013 | 96 | 2013 |
| A branch-and-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem FA Santos, GR Mateus, AS da Cunha Transportation Science 49 (2), 355-368, 2015 | 89 | 2015 |
| 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 | 74 | 2014 |
| A branch-and-price algorithm for a vehicle routing problem with cross-docking FA Santos, GR Mateus, AS da Cunha Electronic notes in discrete mathematics 37, 249-254, 2011 | 68 | 2011 |
| Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem FA Santos, AS da Cunha, GR Mateus Optimization Letters 7, 1537-1547, 2013 | 67 | 2013 |
| 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 | 64 | 2009 |
| The minimum connected dominating set problem: Formulation, valid inequalities and a branch-and-cut algorithm L Simonetti, A Salles da Cunha, A Lucena International conference on network optimization, 162-169, 2011 | 58 | 2011 |
| Heuristic and exact algorithms for a min–max selective vehicle routing problem CA Valle, LC Martinez, AS Da Cunha, GR Mateus Computers & Operations Research 38 (7), 1054-1065, 2011 | 49 | 2011 |
| Balancing message delivery latency and network lifetime through an integrated model for clustering and routing in wireless sensor networks WM Aioffi, CA Valle, GR Mateus, AS da Cunha Computer Networks 55 (13), 2803-2820, 2011 | 42 | 2011 |
| A novel column generation algorithm for the vehicle routing problem with cross-docking FA Santos, GR Mateus, A Salles da Cunha International Conference on Network Optimization, 412-425, 2011 | 41 | 2011 |
| 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 | 34 | 2007 |
| The min-degree constrained minimum spanning tree problem: Formulations and Branch-and-cut algorithm LC Martinez, AS Da Cunha Discrete Applied Mathematics 164, 210-224, 2014 | 25 | 2014 |
| 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 | 24 | 2010 |
| Modelling and solving the joint order batching and picker routing problem in inventories CA Valle, JE Beasley, AS da Cunha Combinatorial Optimization: 4th International Symposium, ISCO 2016, Vietri …, 2016 | 23 | 2016 |
| Lower bounds and exact algorithms for the quadratic minimum spanning tree problem DL Pereira, M Gendreau, AS da Cunha Computers & Operations Research 63, 149-160, 2015 | 21 | 2015 |
| Exact algorithms for a selective vehicle routing problem where the longest route is minimized CA Valle, AS da Cunha, GR Mateus, LC Martinez Electronic Notes in Discrete Mathematics 35, 133-138, 2009 | 20 | 2009 |
| A branch-and-price algorithm for the multi-vehicle covering tour problem R Lopes, VAA Souza, AS da Cunha Electronic Notes in Discrete Mathematics 44, 61-66, 2013 | 19 | 2013 |
| Stronger lower bounds for the quadratic minimum spanning tree problem with adjacency costs DL Pereira, M Gendreau, AS da Cunha Electronic Notes in Discrete Mathematics 41, 229-236, 2013 | 16 | 2013 |
| Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem LH Bicalho, AS Da Cunha, A Lucena Computational Optimization and Applications 63, 755-792, 2016 | 15 | 2016 |
