Ana Paias
Orcid: 0000-0002-1339-1974
According to our database1,
Ana Paias
authored at least 21 papers
between 2008 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
2023
The travelling salesman problem with positional consistency constraints: An application to healthcare services.
Eur. J. Oper. Res., August, 2023
2022
Networks, 2022
The multi-depot family traveling salesman problem and clustered variants: Mathematical formulations and branch-&-cut based methods.
Networks, 2022
Corrigendum to "Solving the family traveling salesman problem" [European Journal of Operational Research, 267, 2018, 453-466].
Eur. J. Oper. Res., 2022
2021
Int. Trans. Oper. Res., 2021
2018
Int. Trans. Oper. Res., 2018
2017
Int. Trans. Oper. Res., 2017
2015
A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern.
Eur. J. Oper. Res., 2015
2013
A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern.
Eur. J. Oper. Res., 2013
Proceedings of the Computational Logistics - 4th International Conference, 2013
2012
Planning Bus Driver Rosters.
Proceedings of the ICORES 2012, 2012
2011
A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters.
J. Sched., 2011
Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem.
J. Heuristics, 2011
Comput. Oper. Res., 2011
2010
Proceedings of the Operations Research Proceedings 2010, 2010
2009
Public Transp., 2009
2008
Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem.
Comput. Oper. Res., 2008
Comput. Oper. Res., 2008