Luis Gouveia

12 papers Journal 12
YearRankTypeTitle / Venue / Authors
2022 J jnl
A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints.
Networks
Bernard Fortz, Luis Gouveia, Pedro Moura
2021 J jnl
Introduction to Special Issue.
Eur. J. Oper. Res.
Luis Gouveia, Seán McGarraghy, Cathal MacSwiney Brugha
2021 J jnl
Preface: Special issue on network analytics and optimization.
Networks
Bernard Fortz, Luis Gouveia, Christina Büsing, Markus Leitner
2020 J jnl
A polyhedral study of the diameter constrained minimum spanning tree problem.
Discret. Appl. Math.
Luis Gouveia, Markus Leitner, Ivana Ljubic
2020 J jnl
Corrigendum to "Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem" [European Journal of Operational Research, 262(3) 2017, 908-928].
Eur. J. Oper. Res.
Luis Gouveia, Markus Leitner, Mario Ruthmair, Ruslan Sadykov
2019 J jnl
Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm.
Eur. J. Oper. Res.
Tolga Bektas, Luis Gouveia, Antonio Martinez-Sykora, Juan José Salazar González
2019 J jnl
Layered graph approaches for combinatorial optimization problems.
Comput. Oper. Res.
Luis Gouveia, Markus Leitner, Mario Ruthmair
2018 J jnl
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem.
Networks
Luis Gouveia, Pierre Pesneau, Mario Ruthmair, Daniel Santos
2018 J jnl
New advances and applications in deterministic and stochastic network optimization.
Networks
Luis Gouveia, Pedro Moura
2018 J jnl
The 2 edge-disjoint 3-paths polyhedron.
Ann. des Télécommunications
Quentin Botton, Bernard Fortz, Luis Gouveia
2017 J jnl
Design of survivable networks with vulnerability constraints.
Eur. J. Oper. Res.
Luis Gouveia, Markus Leitner
2017 J jnl
Spanning trees with a constraint on the number of leaves. A new formulation.
Comput. Oper. Res.
Luis Gouveia, Luidi Simonetti