Ana Paias

23 papers C 1Journal 19Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Formulations and Branch-and-cut algorithms for the Period Travelling Salesman Problem.
Eur. J. Oper. Res.
Sofia Henriques, Ana Paias
2024 J jnl
The family capacitated vehicle routing problem.
Eur. J. Oper. Res.
Raquel Bernardino, Ana Paias
2023 J jnl
The travelling salesman problem with positional consistency constraints: An application to healthcare services.
Eur. J. Oper. Res.
Luís Gouveia, Ana Paias, Mafalda Ponte
2022 J jnl
Corrigendum to "Solving the family traveling salesman problem" [European Journal of Operational Research, 267, 2018, 453-466].
Eur. J. Oper. Res.
Raquel Bernardino, Ana Paias
2022 J jnl
The family traveling salesman problem with incompatibility constraints.
Networks
Raquel Bernardino, Ana Paias
2022 J jnl
The multi-depot family traveling salesman problem and clustered variants: Mathematical formulations and branch-&-cut based methods.
Networks
Raquel Bernardino, Luís Gouveia, Ana Paias, Daniel Santos
2021 J jnl
A network flow-based algorithm for bus driver rerostering.
OR Spectr.
Ana Paias, Marta Mesquita, Margarida Moz, Margarida Vaz Pato
2021 J jnl
Heuristic approaches for the family traveling salesman problem.
Int. Trans. Oper. Res.
Raquel Bernardino, Ana Paias
2018 J jnl
Metaheuristics based on decision hierarchies for the traveling purchaser problem.
Int. Trans. Oper. Res.
Raquel Bernardino, Ana Paias
2018 J jnl
Solving the family traveling salesman problem.
Eur. J. Oper. Res.
Raquel Bernardino, Ana Paias
2017 J jnl
A metaheuristic approach to fisheries survey route planning.
Int. Trans. Oper. Res.
Marta Mesquita, Alberto Murta, Ana Paias, Laura Wise
2016 — ed.
Computational Logistics - 7th International Conference, ICCL 2016, Lisbon, Portugal, September 7-9, 2016, Proceedings
ICCL
Ana Paias, Mario Ruthmair, Stefan Voß
2015 J jnl
A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern.
Eur. J. Oper. Res.
Marta Mesquita, Margarida Vaz Moz, Ana Paias, Margarida Vaz Pato
2013 J jnl
A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern.
Eur. J. Oper. Res.
Marta Mesquita, Margarida Moz, Ana Paias, Margarida Vaz Pato
2013 — conf
TSP with Multiple Time-Windows and Selective Cities.
ICCL
Marta Mesquita, Alberto Murta, Ana Paias, Laura Wise
2012 C conf
Planning Bus Driver Rosters.
ICORES
Marta Mesquita, Margarida Moz, Ana Paias, Margarida Vaz Pato
2011 J jnl
A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters.
J. Sched.
Marta Mesquita, Margarida Moz, Ana Paias, José Pinto Paixão, Margarida Vaz Pato, Ana Respício
2011 J jnl
Models for a traveling purchaser problem with additional side-constraints.
Comput. Oper. Res.
Luis Eduardo Neves Gouveia, Ana Paias, Stefan Voß
2011 J jnl
Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem.
J. Heuristics
Luis Eduardo Neves Gouveia, Ana Paias, Dushyant Sharma
2010 — conf
An Integrated Vehicle-Crew-Roster Problem with Days-Off Pattern.
OR
Marta Mesquita, Margarida Moz, Ana Paias, Margarida Vaz Pato
2009 J jnl
Branching approaches for integrated vehicle and crew scheduling.
Public Transp.
Marta Mesquita, Ana Paias, Ana Respício
2008 J jnl
Modeling and solving the rooted distance-constrained minimum spanning tree problem.
Comput. Oper. Res.
Luis Eduardo Neves Gouveia, Ana Paias, Dushyant Sharma
2008 J jnl
Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem.
Comput. Oper. Res.
Marta Mesquita, Ana Paias