Modeling and solving the rooted distance-constrained minimum spanning tree problem. - Luis Eduardo Neves Gouveia; Ana Paias; Dushyant Sharma (Comput. Oper. Res., 2008)

Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem. - Marta Mesquita; Ana Paias (Comput. Oper. Res., 2008)

Branching approaches for integrated vehicle and crew scheduling. - Marta Mesquita; Ana Paias; Ana Respício (Public Transp., 2009)

An Integrated Vehicle-Crew-Roster Problem with Days-Off Pattern. - Marta Mesquita; Margarida Moz; Ana Paias; Margarida Vaz Pato (OR, 2010)

Models for a traveling purchaser problem with additional side-constraints. - Luis Eduardo Neves Gouveia; Ana Paias; Stefan Voß 001 (Comput. Oper. Res., 2011)

Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem. - Luis Eduardo Neves Gouveia; Ana Paias; Dushyant Sharma (J. Heuristics, 2011)

A new model for the integrated vehicle-crew-rostering problem and a computational study on rosters. - Marta Mesquita; Margarida Moz; Ana Paias; José Pinto Paixão; Margarida Vaz Pato; Ana Respício (J. Sched., 2011)

Planning Bus Driver Rosters. - Marta Mesquita; Margarida Moz; Ana Paias; Margarida Vaz Pato (ICORES, 2012)

TSP with Multiple Time-Windows and Selective Cities. - Marta Mesquita; Alberto Murta; Ana Paias; Laura Wise (ICCL, 2013)

A decomposition approach for the integrated vehicle-crew-roster problem with days-off pattern. - Marta Mesquita; Margarida Moz; Ana Paias; Margarida Vaz Pato (Eur. J. Oper. Res., 2013)

A decompose-and-fix heuristic based on multi-commodity flow models for driver rostering with days-off pattern. - Marta Mesquita; Margarida Vaz Moz; Ana Paias; Margarida Vaz Pato (Eur. J. Oper. Res., 2015)

A metaheuristic approach to fisheries survey route planning. - Marta Mesquita; Alberto Murta; Ana Paias; Laura Wise (Int. Trans. Oper. Res., 2017)

Solving the family traveling salesman problem. - Raquel Bernardino; Ana Paias (Eur. J. Oper. Res., 2018)

Metaheuristics based on decision hierarchies for the traveling purchaser problem. - Raquel Bernardino; Ana Paias (Int. Trans. Oper. Res., 2018)

Heuristic approaches for the family traveling salesman problem. - Raquel Bernardino; Ana Paias (Int. Trans. Oper. Res., 2021)

A network flow-based algorithm for bus driver rerostering. - Ana Paias; Marta Mesquita; Margarida Moz; Margarida Vaz Pato (OR Spectr., 2021)

Corrigendum to "Solving the family traveling salesman problem" [European Journal of Operational Research, 267, 2018, 453-466]. - Raquel Bernardino; Ana Paias (Eur. J. Oper. Res., 2022)

The multi-depot family traveling salesman problem and clustered variants: Mathematical formulations and branch-&-cut based methods. - Raquel Bernardino; Luís Gouveia 001; Ana Paias; Daniel Santos 003 (Networks, 2022)

The family traveling salesman problem with incompatibility constraints. - Raquel Bernardino; Ana Paias (Networks, 2022)

The travelling salesman problem with positional consistency constraints: An application to healthcare services. - Luís Gouveia 001; Ana Paias; Mafalda Ponte (Eur. J. Oper. Res., 2023)

The family capacitated vehicle routing problem. - Raquel Bernardino; Ana Paias (Eur. J. Oper. Res., 2024)

Formulations and Branch-and-cut algorithms for the Period Travelling Salesman Problem. - Sofia Henriques; Ana Paias (Eur. J. Oper. Res., 2025)