New path elimination constraints for multi-depot routing problems. - Tolga Bektas; Luis Eduardo Neves Gouveia; Daniel Santos 003 (Networks, 2017)

Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem. - Luis Gouveia 001; Pierre Pesneau; Mario Ruthmair; Daniel Santos 003 (Networks, 2018)

Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm. - Tolga Bektas; Luís Gouveia 001; Daniel Santos 003 (Eur. J. Oper. Res., 2019)

A simulation framework to evaluate time savings in operating rooms. - Lucas Mertens; Erik Christian Müller; Nina Schwarm; Friedrich Jaime Vogt; Lena Wolbeck; Daniel Santos 003; Inês Marques (PACIS, 2020)

Compact formulations for multi-depot routing problems: Theoretical and computational comparisons. - Tolga Bektas; Luís Gouveia 001; Daniel Santos 003 (Comput. Oper. Res., 2020)

Blood supply chain: a two-stage approach for tactical and operational planning. - Ana Margarida Araújo; Daniel Santos 003; Inês Marques; Ana Barbosa-Póvoa (OR Spectr., 2020)

Designing master surgery schedules with downstream unit integration via stochastic programming. - Daniel Santos 003; Inês Marques (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)

Modelling the Blood Supply Chain. - Maria Meneses; Daniel Santos 003; Ana Barbosa-Póvoa (Eur. J. Oper. Res., 2023)

A multi-objective mixed integer linear programming model for thesis defence scheduling. - João Almeida; Daniel Santos 003; José Rui Figueira; Alexandre P. Francisco (Eur. J. Oper. Res., 2024)

Short-term forecasting of emergency medical services demand exploring machine learning. - Nika Shahidian; Paulo Abreu; Daniel Santos 003; Ana Barbosa-Póvoa (Comput. Ind. Eng., 2025)