| Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem M Mesquita, A Paias Computers & Operations Research 35 (5), 1562-1575, 2008 | 123 | 2008 |
| Modeling and solving the rooted distance-constrained minimum spanning tree problem L Gouveia, A Paias, D Sharma Computers & Operations Research 35 (2), 600-613, 2008 | 64 | 2008 |
| Solving the family traveling salesman problem R Bernardino, A Paias European Journal of Operational Research 267 (2), 453-466, 2018 | 54 | 2018 |
| Branching approaches for integrated vehicle and crew scheduling M Mesquita, A Paias, A Respício Public Transport 1 (1), 21-37, 2009 | 53 | 2009 |
| A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters M Mesquita, M Moz, A Paias, J Paixão, M Pato, A Respício Journal of Scheduling 14, 319-334, 2011 | 51 | 2011 |
| A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern M Mesquita, M Moz, A Paias, M Pato European Journal of Operational Research 229 (2), 318-331, 2013 | 49 | 2013 |
| Models for a traveling purchaser problem with additional side-constraints L Gouveia, A Paias, S Voß Computers & Operations Research 38 (2), 550-558, 2011 | 39 | 2011 |
| State space relaxation for set covering problems related to bus driver scheduling A Paias, J Paixao European Journal of Operational Research 71 (2), 303-316, 1993 | 33 | 1993 |
| A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern M Mesquita, M Moz, A Paias, M Pato European Journal of Operational Research 245 (2), 423-437, 2015 | 27 | 2015 |
| Metaheuristics based on decision hierarchies for the traveling purchaser problem R Bernardino, A Paias International Transactions in Operational Research 25 (4), 1269-1295, 2018 | 23 | 2018 |
| Heuristic approaches for the family traveling salesman problem R Bernardino, A Paias International Transactions in Operational Research 28 (1), 262-295, 2021 | 19 | 2021 |
| Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem L Gouveia, A Paias, D Sharma Journal of Heuristics 17, 23-37, 2011 | 19 | 2011 |
| The family traveling salesman problem with incompatibility constraints R Bernardino, A Paias Networks 79 (1), 47-82, 2022 | 12 | 2022 |
| A metaheuristic approach to fisheries survey route planning M Mesquita, AG Murta, A Paias, L Wise International Transactions in Operational Research 24 (3), 439-464, 2017 | 10 | 2017 |
| Tsp with multiple time-windows and selective cities M Mesquita, A Murta, A Paias, L Wise Computational Logistics: 4th International Conference, ICCL 2013, Copenhagen …, 2013 | 7 | 2013 |
| The travelling salesman problem with positional consistency constraints: An Application to healthcare services L Gouveia, A Paias, M Ponte European Journal of Operational Research 308 (3), 960-989, 2023 | 6 | 2023 |
| The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods R Bernardino, L Gouveia, A Paias, D Santos Networks 80 (4), 502-571, 2022 | 6 | 2022 |
| Solving public transit scheduling problems M Mesquita, M Moz, A Paias, J Paixão, MV Pato, A Respício Centro de Investigação Operacional-Universidade de Lisboa, 2008 | 5 | 2008 |
| The family capacitated vehicle routing problem R Bernardino, A Paias European Journal of Operational Research 314 (3), 836-853, 2024 | 4 | 2024 |
| A network flow-based algorithm for bus driver rerostering A Paias, M Mesquita, M Moz, M Pato OR Spectrum 43, 543-576, 2021 | 3 | 2021 |
Luis GouveiaProfessor Catedrático da faculdade de Ciências da Universidade de Lisboa在 fc.ul.pt 的电子邮件经过验证
