Luis Gouveia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Luis Gouveia has a total of 85 co-authors. Here are the top co-authors by number of shared publications:
- Amaro de Sousa
Department of Electronics, Telecommunications and Informatics/IT, University of Aveiro, Campus Universitário de Santiago, 3810-193 Aveiro, Portugal
12 shared publications - Bernard Fortz
Département d'Informatique Université libre de Bruxelles Brussels Belgium
12 shared publications - Markus Leitner
Department of Operations Analytics, Vrije Universiteit Amsterdam, 1081 HV Amsterdam, Netherlands
11 shared publications - Pedro Moura
Departamento de Estatística e Investigação Operacional Faculdade de Ciências da Universidade de Lisboa Lisbon Portugal
10 shared publications - Ivana Ljubić
ESSEC Business School Cergy‐Pontoise France
8 shared publications - Pedro Patrício
Universidade da Beira Interior
8 shared publications
Latest Publications
- 28 October 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 331 (1) , 62-76
On location-routing formulations for the Hamiltonian p -median problem
- 28 October 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 331 (1) , 62-76
On location-routing formulations for the Hamiltonian p -median problem
- 15 May 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 327 (1) , 42-57
Formulations and branch-and-cut algorithms for cycle covers with up to p cycles
- 15 May 2025
- Published by Elsevier in European Journal of Operational Research
- Vol. 327 (1) , 42-57
Formulations and branch-and-cut algorithms for cycle covers with up to p cycles
- 28 June 2024
- Published by Springer Nature
- p. 149-161
Models for Network Flow and Network Design Problems with Piecewise Linear Costs
- 28 June 2024
- Published by Springer Nature
- p. 149-161
Models for Network Flow and Network Design Problems with Piecewise Linear Costs
- 28 June 2024
- Published by Springer Nature
- p. 37-58
Common-Flow Formulations for the Diameter Constrained Spanning and Steiner Tree Problems
- 28 June 2024
- Published by Springer Nature
- p. 37-58
Common-Flow Formulations for the Diameter Constrained Spanning and Steiner Tree Problems
- Open Access
- 1 March 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 316 (2) , 473-487
The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms
- 1 March 2024
- Published by Elsevier in European Journal of Operational Research
- Vol. 316 (2) , 473-487
Open AccessThe Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms
- 1 March 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 57 (2) , 512-530
Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm
We study the multi-depot split-delivery vehicle routing problem (MDSDVRP) that combines the advantages and potential cost savings of multiple depots and split deliveries and develop the first exact algorithm for this problem. We propose an integer programming formulation using a small number of decision variables and several sets of valid inequalities. These inequalities focus on ensuring the vehicles’ capacity limits and that vehicles return to their initial depot. As we show that the new constraints do not guarantee these aspects, our branch-and-cut framework also includes an efficient feasibility check for candidate solutions and explicit feasibility cuts. The algorithm that also uses a comparably simple, yet effective heuristic to compute high-quality initial solutions is tested on the MDSDVRP and two well-known special cases, the split-delivery vehicle routing problem (SDVRP) and the multi-depot traveling salesman problem (MDTSP). The results show that the new inequalities tighten the linear programming relaxation, increase the performance of the branch-and-cut algorithm, and reduce the number of required feasibility cuts. We report the first proven optimal results for the MDSDVRP and show that our algorithm significantly outperforms the state-of-the-art for the MDTSP while being competitive on the SDVRP. For the latter, 20 instances are solved for the first time, and new best primal and dual bounds are found for others. Funding: This work was supported by the Fundação para a Ciência e a Tecnologia [Project UIDB/04561/2020]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.1179 .
- 1 March 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 57 (2) , 512-530
Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm
We study the multi-depot split-delivery vehicle routing problem (MDSDVRP) that combines the advantages and potential cost savings of multiple depots and split deliveries and develop the first exact algorithm for this problem. We propose an integer programming formulation using a small number of decision variables and several sets of valid inequalities. These inequalities focus on ensuring the vehicles’ capacity limits and that vehicles return to their initial depot. As we show that the new constraints do not guarantee these aspects, our branch-and-cut framework also includes an efficient feasibility check for candidate solutions and explicit feasibility cuts. The algorithm that also uses a comparably simple, yet effective heuristic to compute high-quality initial solutions is tested on the MDSDVRP and two well-known special cases, the split-delivery vehicle routing problem (SDVRP) and the multi-depot traveling salesman problem (MDTSP). The results show that the new inequalities tighten the linear programming relaxation, increase the performance of the branch-and-cut algorithm, and reduce the number of required feasibility cuts. We report the first proven optimal results for the MDSDVRP and show that our algorithm significantly outperforms the state-of-the-art for the MDTSP while being competitive on the SDVRP. For the latter, 20 instances are solved for the first time, and new best primal and dual bounds are found for others. Funding: This work was supported by the Fundação para a Ciência e a Tecnologia [Project UIDB/04561/2020]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2022.1179 .
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
In this article, we study the multi‐depot family traveling salesman problem (MDFTSP) and two clustered variants, the soft‐clustered MDFTSP (SC‐MDFTSP) and the hard‐clustered MDFTSP. We emphasize the relevance of this study by relating the problems with warehouse activities supported by scattered storage systems and by pointing out that clustered variants of routing problems have been scarcely addressed in the literature. For these three problems, we present several mixed integer linear programming formulations and develop appropriate branch‐&‐cut based algorithms which are tested with a newly generated data set including instances with up to 200 nodes and 40 depots. The results from the computational experiments allow us to identify the main differences between the three problems concerning modeling approaches as well as solution methods and put in evidence that these problems are challenging problems, in particular the SC‐MDFTSP.
The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods
In this article, we study the multi‐depot family traveling salesman problem (MDFTSP) and two clustered variants, the soft‐clustered MDFTSP (SC‐MDFTSP) and the hard‐clustered MDFTSP. We emphasize the relevance of this study by relating the problems with warehouse activities supported by scattered storage systems and by pointing out that clustered variants of routing problems have been scarcely addressed in the literature. For these three problems, we present several mixed integer linear programming formulations and develop appropriate branch‐&‐cut based algorithms which are tested with a newly generated data set including instances with up to 200 nodes and 40 depots. The results from the computational experiments allow us to identify the main differences between the three problems concerning modeling approaches as well as solution methods and put in evidence that these problems are challenging problems, in particular the SC‐MDFTSP.
- 1 October 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 285, 364-379
A polyhedral study of the diameter constrained minimum spanning tree problem
- 1 October 2020
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 285, 364-379
A polyhedral study of the diameter constrained minimum spanning tree problem