Abílio Lucena

1.0k total citations
37 papers, 570 citations indexed

About

Abílio Lucena is a scholar working on Industrial and Manufacturing Engineering, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, Abílio Lucena has authored 37 papers receiving a total of 570 indexed citations (citations by other indexed papers that have themselves been cited), including 27 papers in Industrial and Manufacturing Engineering, 19 papers in Computational Theory and Mathematics and 10 papers in Computer Networks and Communications. Recurrent topics in Abílio Lucena's work include Vehicle Routing Optimization Methods (20 papers), Advanced Graph Theory Research (16 papers) and Optimization and Packing Problems (13 papers). Abílio Lucena is often cited by papers focused on Vehicle Routing Optimization Methods (20 papers), Advanced Graph Theory Research (16 papers) and Optimization and Packing Problems (13 papers). Abílio Lucena collaborates with scholars based in Brazil, United States and Canada. Abílio Lucena's co-authors include Alexandre Salles da Cunha, Nelson Maculan, Maurício G. C. Resende, Luidi Simonetti, Paula Zabala, Isabel Méndez‐Díaz, J. E. Beasley, Bernard Gendron, Nagraj Balakrishnan and Richard T. Wong and has published in prestigious journals such as SHILAP Revista de lepidopterología, European Journal of Operational Research and Mathematical Programming.

In The Last Decade

Abílio Lucena

33 papers receiving 534 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Abílio Lucena Brazil 14 370 187 167 77 66 37 570
Jesús Sánchez‐Oro Spain 15 371 1.0× 130 0.7× 110 0.7× 82 1.1× 168 2.5× 53 651
Sourour Elloumi France 13 288 0.8× 124 0.7× 187 1.1× 66 0.9× 66 1.0× 34 653
Eduardo G. Pardo Spain 13 414 1.1× 96 0.5× 93 0.6× 41 0.5× 99 1.5× 39 591
Jozef Kratica Serbia 16 393 1.1× 90 0.5× 311 1.9× 126 1.6× 103 1.6× 44 787
Philippe Mahey France 12 181 0.5× 126 0.7× 145 0.9× 94 1.2× 27 0.4× 41 484
C.W. Duin Netherlands 13 293 0.8× 100 0.5× 175 1.0× 120 1.6× 66 1.0× 22 509
Renata M. Aiex Brazil 4 312 0.8× 129 0.7× 62 0.4× 41 0.5× 157 2.4× 4 448
Zonghao Gu United States 6 342 0.9× 83 0.4× 104 0.6× 46 0.6× 22 0.3× 6 497
Young‐Soo Myung South Korea 11 211 0.6× 134 0.7× 130 0.8× 145 1.9× 39 0.6× 28 484
Michael A. Forbes United States 13 185 0.5× 86 0.5× 143 0.9× 54 0.7× 140 2.1× 45 563

Countries citing papers authored by Abílio Lucena

Since Specialization
Citations

This map shows the geographic impact of Abílio Lucena's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Abílio Lucena with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Abílio Lucena more than expected).

Fields of papers citing papers by Abílio Lucena

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Abílio Lucena. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Abílio Lucena. The network helps show where Abílio Lucena may publish in the future.

Co-authorship network of co-authors of Abílio Lucena

This figure shows the co-authorship network connecting the top 25 collaborators of Abílio Lucena. A scholar is included among the top collaborators of Abílio Lucena based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Abílio Lucena. Abílio Lucena is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Lucena, Abílio, et al.. (2020). Optimizing concurrency under Scheduling by Edge Reversal. Networks. 77(4). 520–537.
2.
Cunha, Alexandre Salles da & Abílio Lucena. (2019). Modeling and solving the angular constrained minimum spanning tree problem. Computers & Operations Research. 112. 104775–104775. 2 indexed citations
3.
Ribeiro, Glaydston Mattos, et al.. (2017). A Location-Allocation Model for Logistics Integration Centers. 44(2). 8 indexed citations
4.
Ribeiro, Glaydston Mattos, et al.. (2017). Localização-alocação de centros de integração logística submetidos a demandas par-a-par. SHILAP Revista de lepidopterología. 25(1). 51–60. 2 indexed citations
5.
Simonetti, Luidi, et al.. (2015). Lagrangian heuristics for the Quadratic Knapsack Problem. Computational Optimization and Applications. 63(1). 97–120. 5 indexed citations
6.
Cunha, Alexandre Salles da, et al.. (2015). Branch-and-cut-and-price algorithms for the Degree Constrained Minimum Spanning Tree Problem. Computational Optimization and Applications. 63(3). 755–792. 8 indexed citations
7.
Lucena, Abílio, Alexandre Salles da Cunha, & Luidi Simonetti. (2013). Formulating and Solving the Minimum Dominating Cycle Problem. Electronic Notes in Discrete Mathematics. 41. 423–430.
8.
Simonetti, Luidi, Alexandre Salles da Cunha, & Abílio Lucena. (2012). Polyhedral results and a Branch-and-cut algorithm for the $$k$$ -cardinality tree problem. Mathematical Programming. 142(1-2). 511–538. 3 indexed citations
9.
Lucena, Abílio, Nelson Maculan, & Luidi Simonetti. (2010). Reformulations and solution algorithms for the maximum leaf spanning tree problem. Computational Management Science. 7(3). 289–311. 32 indexed citations
10.
Cunha, Alexandre Salles da, et al.. (2009). The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation. Discrete Applied Mathematics. 158(12). 1305–1314. 6 indexed citations
11.
Lucena, Abílio, Celso C. Ribeiro, & Andréa Cynthia Santos. (2009). A hybrid heuristic for the diameter constrained minimum spanning tree problem. Journal of Global Optimization. 46(3). 363–381. 14 indexed citations
12.
Méndez‐Díaz, Isabel, Paula Zabala, & Abílio Lucena. (2008). A new formulation for the Traveling Deliveryman Problem. Discrete Applied Mathematics. 156(17). 3223–3237. 66 indexed citations
13.
Cunha, Alexandre Salles da, Abílio Lucena, Nelson Maculan, & Maurício G. C. Resende. (2008). A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs. Discrete Applied Mathematics. 157(6). 1198–1217. 27 indexed citations
14.
Cunha, Alexandre Salles da & Abílio Lucena. (2008). A Hybrid Relax-and-Cut/Branch and Cut Algorithm for the Degree-Constrained Minimum Spanning Tree Problem ⁄. 2 indexed citations
15.
Lucena, Abílio, et al.. (2005). Using Lagrangian dual information to generate degree constrained spanning trees. Discrete Applied Mathematics. 154(5). 703–717. 28 indexed citations
16.
Lucena, Abílio & Maurício G. C. Resende. (2003). Strong lower bounds for the prize collecting Steiner problem in graphs. Discrete Applied Mathematics. 141(1-3). 277–294. 45 indexed citations
17.
Lucena, Abílio, et al.. (2003). Stronger K-tree relaxations for the vehicle routing problem. European Journal of Operational Research. 158(1). 56–71. 20 indexed citations
18.
Lucena, Abílio, et al.. (2002). Optimal rectangular partitions. Networks. 41(1). 51–67. 14 indexed citations
19.
Lucena, Abílio & J. E. Beasley. (1998). A branch and cut algorithm for the Steiner problem in graphs. Networks. 31(1). 39–59. 25 indexed citations
20.
Balakrishnan, Nagraj, Abílio Lucena, & Richard T. Wong. (1992). Scheduling examinations to reduce second-order conflicts. Computers & Operations Research. 19(5). 353–361. 34 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Rankless by CCL
2026