Ana Paias

484 total citations
22 papers, 342 citations indexed

About

Ana Paias is a scholar working on Industrial and Manufacturing Engineering, Artificial Intelligence and Automotive Engineering. According to data from OpenAlex, Ana Paias has authored 22 papers receiving a total of 342 indexed citations (citations by other indexed papers that have themselves been cited), including 22 papers in Industrial and Manufacturing Engineering, 7 papers in Artificial Intelligence and 5 papers in Automotive Engineering. Recurrent topics in Ana Paias's work include Vehicle Routing Optimization Methods (22 papers), Metaheuristic Optimization Algorithms Research (7 papers) and Optimization and Packing Problems (6 papers). Ana Paias is often cited by papers focused on Vehicle Routing Optimization Methods (22 papers), Metaheuristic Optimization Algorithms Research (7 papers) and Optimization and Packing Problems (6 papers). Ana Paias collaborates with scholars based in Portugal, United States and Germany. Ana Paias's co-authors include Marta Mesquita, Luı́s Gouveia, Margarida Moz, Margarida Vaz Pato, Ana Respício, Dushyant Sharma, José M. P. Paixão, Stefan Voß, Laura Wise and Alberto G. Murta and has published in prestigious journals such as European Journal of Operational Research, Computers & Operations Research and Networks.

In The Last Decade

Ana Paias

20 papers receiving 318 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Ana Paias Portugal 12 280 120 79 75 58 22 342
C. Y. Cheong Singapore 8 255 0.9× 71 0.6× 35 0.4× 48 0.6× 126 2.2× 12 396
Francesca Vocaturo Italy 13 345 1.2× 111 0.9× 42 0.5× 38 0.5× 29 0.5× 28 428
François Vanderbeck France 7 319 1.1× 118 1.0× 34 0.4× 29 0.4× 31 0.5× 9 399
Jorge Riera‐Ledesma Spain 11 348 1.2× 194 1.6× 81 1.0× 25 0.3× 58 1.0× 16 414
Sandra Ulrich Ngueveu France 9 270 1.0× 126 1.1× 30 0.4× 35 0.5× 27 0.5× 25 357
Lloyd W. Clarke United States 6 467 1.7× 102 0.8× 65 0.8× 136 1.8× 19 0.3× 8 574
İbrahim Muter Türkiye 13 361 1.3× 79 0.7× 28 0.4× 57 0.8× 23 0.4× 17 437
Slim Belhaiza Saudi Arabia 11 200 0.7× 118 1.0× 28 0.4× 50 0.7× 37 0.6× 25 384
Matthias Prandtstetter Austria 9 234 0.8× 88 0.7× 54 0.7× 82 1.1× 15 0.3× 24 345
Attila A. Kovacs Austria 6 438 1.6× 261 2.2× 102 1.3× 55 0.7× 25 0.4× 8 486

Countries citing papers authored by Ana Paias

Since Specialization
Citations

This map shows the geographic impact of Ana Paias'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 Ana Paias with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ana Paias more than expected).

Fields of papers citing papers by Ana Paias

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Ana Paias. 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 Ana Paias. The network helps show where Ana Paias may publish in the future.

Co-authorship network of co-authors of Ana Paias

This figure shows the co-authorship network connecting the top 25 collaborators of Ana Paias. A scholar is included among the top collaborators of Ana Paias 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 Ana Paias. Ana Paias 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.
Paias, Ana, et al.. (2025). Formulations and Branch-and-cut algorithms for the Period Travelling Salesman Problem. European Journal of Operational Research. 323(3). 739–752.
2.
Paias, Ana, et al.. (2023). The family capacitated vehicle routing problem. European Journal of Operational Research. 314(3). 836–853. 6 indexed citations
3.
Gouveia, Luı́s, et al.. (2022). The travelling salesman problem with positional consistency constraints: An application to healthcare services. European Journal of Operational Research. 308(3). 960–989. 4 indexed citations
4.
Mesquita, Marta, Ana Paias, & Laura Wise. (2021). Optimizing the routes of a research vessel with an hybrid metaheuristic. International Journal of Management Science and Engineering Management. 16(1). 58–71. 3 indexed citations
5.
Paias, Ana, et al.. (2021). The family traveling salesman problem with incompatibility constraints. Networks. 79(1). 47–82. 11 indexed citations
6.
Paias, Ana, Marta Mesquita, Margarida Moz, & Margarida Vaz Pato. (2021). A network flow-based algorithm for bus driver rerostering. OR Spectrum. 43(2). 543–576. 3 indexed citations
7.
Paias, Ana, et al.. (2017). Solving the family traveling salesman problem. European Journal of Operational Research. 267(2). 453–466. 41 indexed citations
8.
Paias, Ana, et al.. (2016). Metaheuristics based on decision hierarchies for the traveling purchaser problem. International Transactions in Operational Research. 25(4). 1269–1295. 17 indexed citations
9.
Mesquita, Marta, Alberto G. Murta, Ana Paias, & Laura Wise. (2016). A metaheuristic approach to fisheries survey route planning. International Transactions in Operational Research. 24(3). 439–464. 9 indexed citations
10.
Gouveia, Luı́s, et al.. (2015). Models for a Steiner multi-ring network design problem with revenues. Top. 24(2). 360–380. 2 indexed citations
11.
Mesquita, Marta, Margarida Moz, Ana Paias, & Margarida Vaz Pato. (2015). A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern. European Journal of Operational Research. 245(2). 423–437. 15 indexed citations
12.
Mesquita, Marta, Margarida Moz, Ana Paias, & Margarida Vaz Pato. (2013). A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern. European Journal of Operational Research. 229(2). 318–331. 22 indexed citations
13.
Gouveia, Luı́s, Ana Paias, & Stefan Voß. (2010). Models for a traveling purchaser problem with additional side-constraints. Computers & Operations Research. 38(2). 550–558. 22 indexed citations
14.
Gouveia, Luı́s, Ana Paias, & Dushyant Sharma. (2010). Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem. Journal of Heuristics. 17(1). 23–37. 9 indexed citations
15.
Mesquita, Marta, Margarida Moz, Ana Paias, et al.. (2010). A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters. Journal of Scheduling. 14(4). 319–334. 25 indexed citations
16.
Mesquita, Marta, Margarida Moz, Ana Paias, et al.. (2008). Solving Public Transit Scheduling Problems. University of Lisbon Repository (University of Lisbon).
17.
Mesquita, Marta, Ana Paias, & Ana Respício. (2008). Branching approaches for integrated vehicle and crew scheduling. Public Transport. 1(1). 21–37. 29 indexed citations
18.
Gouveia, Luı́s, Ana Paias, & Dushyant Sharma. (2006). Modeling and solving the rooted distance-constrained minimum spanning tree problem. Computers & Operations Research. 35(2). 600–613. 25 indexed citations
19.
Mesquita, Marta & Ana Paias. (2006). Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem. Computers & Operations Research. 35(5). 1562–1575. 66 indexed citations
20.
Paias, Ana & José M. P. Paixão. (1993). State space relaxation for set covering problems related to bus driver scheduling. European Journal of Operational Research. 71(2). 303–316. 12 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

Breakdown of academic impact, for papers by C. Y. Cheong Breakdown of academic impact, for papers by Francesca Vocaturo Breakdown of academic impact, for papers by François Vanderbeck Breakdown of academic impact, for papers by Jorge Riera‐Ledesma Breakdown of academic impact, for papers by Sandra Ulrich Ngueveu Breakdown of academic impact, for papers by Lloyd W. Clarke Breakdown of academic impact, for papers by İbrahim Muter Breakdown of academic impact, for papers by Slim Belhaiza Breakdown of academic impact, for papers by Matthias Prandtstetter Breakdown of academic impact, for papers by Attila A. Kovacs
Rankless by CCL
2026