Luís Gouveia

12 papers Journal 12
YearRankTypeTitle / Venue / Authors
2026 J jnl
On location-routing formulations for the Hamiltonian p -median problem.
Eur. J. Oper. Res.
Francisco Canas, Luís Gouveia
2025 J jnl
Formulations and branch-and-cut algorithms for cycle covers with up to p cycles.
Eur. J. Oper. Res.
Francisco Canas, Luís Gouveia
2024 J jnl
The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms.
Eur. J. Oper. Res.
Michele Barbato, Luís Gouveia
2023 J jnl
Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm.
Transp. Sci.
Luís Gouveia, Markus Leitner, Mario Ruthmair
2023 J jnl
Node based compact formulations for the Hamiltonian
Networks
Michele Barbato, Francisco Canas, Luís Gouveia, Pierre Pesneau
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
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
2020 J jnl
Compact formulations for multi-depot routing problems: Theoretical and computational comparisons.
Comput. Oper. Res.
Tolga Bektas, Luís Gouveia, Daniel Santos
2019 J jnl
Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm.
Eur. J. Oper. Res.
Tolga Bektas, Luís Gouveia, Daniel Santos
2018 J jnl
Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints.
Comput. Oper. Res.
Luís Gouveia, Martim Joyce-Moniz, Markus Leitner
2018 J jnl
Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol.
Discret. Appl. Math.
Bernard Fortz, Luís Gouveia, Martim Joyce-Moniz
2018 J jnl
Preface.
Electron. Notes Discret. Math.
Luís Gouveia, Pedro Moura