Follow
Ana Paias
Ana Paias
Faculdade de Ciências da Universidade de Lisboa
Verified email at fc.ul.pt
Title
Cited by
Cited by
Year
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
1252008
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
652008
Solving the family traveling salesman problem
R Bernardino, A Paias
European Journal of Operational Research 267 (2), 453-466, 2018
592018
Branching approaches for integrated vehicle and crew scheduling
M Mesquita, A Paias, A Respício
Public Transport 1 (1), 21-37, 2009
542009
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
532011
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
512013
Models for a traveling purchaser problem with additional side-constraints
L Gouveia, A Paias, S Voß
Computers & Operations Research 38 (2), 550-558, 2011
412011
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
321993
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
282015
Metaheuristics based on decision hierarchies for the traveling purchaser problem
R Bernardino, A Paias
International Transactions in Operational Research 25 (4), 1269-1295, 2018
252018
Heuristic approaches for the family traveling salesman problem
R Bernardino, A Paias
International Transactions in Operational Research 28 (1), 262-295, 2021
192021
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
192011
The family traveling salesman problem with incompatibility constraints
R Bernardino, A Paias
Networks 79 (1), 47-82, 2022
122022
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
112017
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
72023
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
72013
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
62022
The family capacitated vehicle routing problem
R Bernardino, A Paias
European Journal of Operational Research 314 (3), 836-853, 2024
52024
A network flow-based algorithm for bus driver rerostering
A Paias, M Mesquita, M Moz, M Pato
OR Spectrum 43, 543-576, 2021
52021
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
52008
The system can't perform the operation now. Try again later.
Articles 1–20