Luis Eduardo Neves Gouveia

ORCID

Publication Activity (10 Years)

Years Active: 1991-2022
Publications (10 Years): 28

Top Venues

Publications

Bernard Fortz, Luis Eduardo Neves Gouveia, Pedro Moura
A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints. Networks 80 (2) (2022)
Raquel Bernardino, Luis Eduardo Neves Gouveia, Ana Paias, Daniel Santos
The multi-depot family traveling salesman problem and clustered variants: Mathematical formulations and branch-&-cut based methods. Networks 80 (4) (2022)
Bernard Fortz, Luis Eduardo Neves Gouveia, Christina Büsing, Markus Leitner
Preface: Special issue on network analytics and optimization. Networks 77 (4) (2021)
Tolga Bektas, Luis Eduardo Neves Gouveia, Daniel Santos
Compact formulations for multi-depot routing problems: Theoretical and computational comparisons. Comput. Oper. Res. 124 (2020)
Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic
A polyhedral study of the diameter constrained minimum spanning tree problem. Discret. Appl. Math. 285 (2020)
Luis Eduardo Neves Gouveia, Markus Leitner, Mario Ruthmair, Ruslan Sadykov
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. 285 (3) (2020)
Tolga Bektas, Luis Eduardo Neves Gouveia, Antonio Martinez-Sykora, Juan José Salazar González
Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm. Eur. J. Oper. Res. 273 (2) (2019)
Tolga Bektas, Luis Eduardo Neves Gouveia, Daniel Santos
Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm. Eur. J. Oper. Res. 276 (1) (2019)
Luis Eduardo Neves Gouveia, Markus Leitner, Mario Ruthmair
Layered graph approaches for combinatorial optimization problems. Comput. Oper. Res. 102 (2019)
Luis Eduardo Neves Gouveia, Martim Joyce-Moniz, Markus Leitner
Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints. Comput. Oper. Res. 91 (2018)
Luis Eduardo Neves Gouveia, Pedro Moura
New advances and applications in deterministic and stochastic network optimization. Networks 72 (1) (2018)
Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Joyce-Moniz
Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol. Discret. Appl. Math. 234 (2018)
Luis Eduardo Neves Gouveia, Pierre Pesneau, Mario Ruthmair, Daniel Santos
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem. Networks 71 (4) (2018)
Quentin Botton, Bernard Fortz, Luis Eduardo Neves Gouveia
The 2 edge-disjoint 3-paths polyhedron. Ann. des Télécommunications 73 (1-2) (2018)
Luis Eduardo Neves Gouveia, Pedro Moura
Preface. Electron. Notes Discret. Math. 64 (2018)
Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Joyce-Moniz
Models for the piecewise linear unsplittable multicommodity flow problems. Eur. J. Oper. Res. 261 (1) (2017)
Luis Eduardo Neves Gouveia, Luidi Simonetti
Spanning trees with a constraint on the number of leaves. A new formulation. Comput. Oper. Res. 81 (2017)
Luis Eduardo Neves Gouveia, Markus Leitner
Design of survivable networks with vulnerability constraints. Eur. J. Oper. Res. 258 (1) (2017)
Luis Eduardo Neves Gouveia, Michal Pióro, Jacek Rak
Preface: Static and dynamic optimization models for network routing problems. Networks 69 (1) (2017)
Luis Eduardo Neves Gouveia, Markus Leitner, Mario Ruthmair
Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem. Eur. J. Oper. Res. 262 (3) (2017)
Tolga Bektas, Luis Eduardo Neves Gouveia, Daniel Santos
New path elimination constraints for multi-depot routing problems. Networks 70 (3) (2017)
Bernard Gendron, Luis Eduardo Neves Gouveia
Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems. Transp. Sci. 51 (2) (2017)
Bernard Fortz, Luis Eduardo Neves Gouveia
Editorial. EURO J. Comput. Optim. 4 (2) (2016)
Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Joyce-Moniz
On the convex piecewise linear unsplittable multicommodity flow problem. DRCN (2016)
Luis Eduardo Neves Gouveia, Andrea Lodi, Ali Ridha Mahjoub
Preface. Discret. Optim. 22 (2016)
I. Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luis Eduardo Neves Gouveia, Pierre Pesneau
-edge-connected 3-hop-constrained network design problem. Networks 67 (2) (2016)
Amaro de Sousa, Luis Eduardo Neves Gouveia, Pedro Patrício
Maximization of protected demand in telecommunication networks using partial disjoint paths. RNDM (2016)
Luis Eduardo Neves Gouveia, Pedro Patrício, Amaro de Sousa
Lexicographical minimization of routing hops in hop-constrained node survivable networks. Telecommun. Syst. 62 (2) (2016)
Luis Eduardo Neves Gouveia, Pedro Martins
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations. EURO J. Comput. Optim. 3 (1) (2015)
Quentin Botton, Bernard Fortz, Luis Eduardo Neves Gouveia
On the hop-constrained survivable network design problem with reliable edges. Comput. Oper. Res. 64 (2015)
Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic
The two-level diameter constrained spanning tree problem. Math. Program. 150 (1) (2015)
Luis Eduardo Neves Gouveia, Maria João Lopes, Amaro de Sousa
Single PON network design with unconstrained splitting stages. Eur. J. Oper. Res. 240 (2) (2015)
Miguel Fragoso Constantino, Luis Eduardo Neves Gouveia, Maria Cândida Mourão, Ana Catarina Nunes
The mixed capacitated arc routing problem with non-overlapping routes. Eur. J. Oper. Res. 244 (2) (2015)
Luis Eduardo Neves Gouveia, Mario Ruthmair
Load-dependent and precedence-based models for pickup and delivery problems. Comput. Oper. Res. 63 (2015)
Daniele Catanzaro, Luis Eduardo Neves Gouveia, Martine Labbé
Improved integer linear programming formulations for the job Sequencing and tool Switching Problem. Eur. J. Oper. Res. 244 (3) (2015)
Maria Teresa Godinho, Luis Eduardo Neves Gouveia, Pierre Pesneau
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem. Discret. Appl. Math. 164 (2014)
Graça Marques Gonçalves, Luis Eduardo Neves Gouveia, Margarida Vaz Pato
An improved decomposition-based heuristic to design a water distribution network for an irrigation system. Ann. Oper. Res. 219 (1) (2014)
Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic
Hop constrained Steiner trees with multiple root nodes. Eur. J. Oper. Res. 236 (1) (2014)
Luis Eduardo Neves Gouveia, Pedro Moura, Mario Ruthmair, Amaro de Sousa
Spanning trees with variable degree bounds. Eur. J. Oper. Res. 239 (3) (2014)
Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Moniz
Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol. ISCO (2014)
Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Gilbert Laporte, Dilson Lucas Pereira, Adam Wojciechowski
-median problem. Networks 63 (4) (2014)
Tolga Bektas, Luis Eduardo Neves Gouveia
Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? Eur. J. Oper. Res. 236 (3) (2014)
Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic
Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities. Eur. J. Oper. Res. 225 (2) (2013)
Quentin Botton, Bernard Fortz, Luis Eduardo Neves Gouveia, Michael Poss
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem. INFORMS J. Comput. 25 (1) (2013)
Paola Cappanera, Luis Eduardo Neves Gouveia, Maria Grazia Scutellà
Models and valid inequalities to asymmetric skill-based routing problems. EURO J. Transp. Logist. 2 (1-2) (2013)
Bernard Fortz, Luis Eduardo Neves Gouveia
SI on computational methods for network optimization problems. EURO J. Comput. Optim. 1 (3-4) (2013)
Luis Eduardo Neves Gouveia, Juan José Salazar González
Polynomial-time separation of Enhanced Reverse Multistar inequalities. Oper. Res. Lett. 41 (3) (2013)
Luis Eduardo Neves Gouveia, Stefan Voß
Editorial. Networks 61 (2) (2013)
Luis Eduardo Neves Gouveia, Jorge Riera-Ledesma, Juan José Salazar González
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route. Networks 61 (4) (2013)
Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic
On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes. ISCO (2012)
Christophe Duhamel, Luis Eduardo Neves Gouveia, Pedro Moura, Maurício C. de Souza
-degree constrained minimum spanning tree problem with node-degree costs. Networks 60 (1) (2012)
Ioannis Gamvros, Luis Eduardo Neves Gouveia, S. Raghavan
Reload cost trees and network design. Networks 59 (4) (2012)
Luis Eduardo Neves Gouveia, Maria Grazia Scutellà
Editorial. Networks 59 (1) (2012)
Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic
A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes. INOC (2011)
Paola Cappanera, Luis Eduardo Neves Gouveia, Maria Grazia Scutellà
The Skill Vehicle Routing Problem. INOC (2011)
Luis Eduardo Neves Gouveia, Ana Paias, Stefan Voß
Models for a traveling purchaser problem with additional side-constraints. Comput. Oper. Res. 38 (2) (2011)
Luis Eduardo Neves Gouveia, Pedro Moura, Amaro de Sousa
Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks. INOC (2011)
Luis Eduardo Neves Gouveia, Pedro Patrício, Amaro de Sousa
Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models. Int. Trans. Oper. Res. 18 (3) (2011)
Luis Eduardo Neves Gouveia, João Telhada
Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves. INOC (2011)
Luis Eduardo Neves Gouveia, Pedro Patrício, Amaro de Sousa
Lexicographical Minimization of Routing Hops in Telecommunication Networks. INOC (2011)
Luis Eduardo Neves Gouveia, Luidi Simonetti, Eduardo Uchoa
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. Math. Program. 128 (1-2) (2011)
Luis Eduardo Neves Gouveia, Ana Paias, Dushyant Sharma
Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem. J. Heuristics 17 (1) (2011)
Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic
The Two Level Network Design Problem with Secondary Hop Constraints. INOC (2011)
Luis Eduardo Neves Gouveia, Pedro Moura, Amaro de Sousa
Prize collecting Steiner trees with node degree dependent costs. Comput. Oper. Res. 38 (1) (2011)
Maria Teresa Godinho, Luis Eduardo Neves Gouveia, Pierre Pesneau
Hop-indexed Circuit-based formulations for the Traveling Salesman Problem. Electron. Notes Discret. Math. 36 (2010)
Isabel Correia, Luis Eduardo Neves Gouveia, Francisco Saldanha-da-Gama
Discretized formulations for capacitated location problems with modular distribution costs. Eur. J. Oper. Res. 204 (2) (2010)
Luis Eduardo Neves Gouveia, Maria Cândida Mourão, Leonor Santiago Pinto
Lower bounds for the mixed capacitated arc routing problem. Comput. Oper. Res. 37 (4) (2010)
Margarida Corte-Real, Luis Eduardo Neves Gouveia
A node rooted flow-based model for the local access network expansion problem. Eur. J. Oper. Res. 204 (1) (2010)
Bernard Fortz, Luis Eduardo Neves Gouveia
Editorial. Networks 55 (3) (2010)
Luis Eduardo Neves Gouveia, Pedro Moura
Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations. Electron. Notes Discret. Math. 36 (2010)
Luis Eduardo Neves Gouveia, Juan José Salazar González
On the Vehicle Routing Problem with lower bound capacities. Electron. Notes Discret. Math. 36 (2010)
Agostinho Agra, Luis Eduardo Neves Gouveia, Cristina Requejo
Extended formulations for the cardinality constrained subtree of a tree problem. Oper. Res. Lett. 37 (3) (2009)
Luis Eduardo Neves Gouveia
Preface. Networks 53 (2) (2009)
Isabel Correia, Luis Eduardo Neves Gouveia, Francisco Saldanha-da-Gama
Solving the variable size bin packing problem with discretized formulations. Comput. Oper. Res. 35 (6) (2008)
Luis Eduardo Neves Gouveia, João Telhada
The multi-weighted Steiner tree problem: A reformulation by intersection. Comput. Oper. Res. 35 (11) (2008)
Luis Eduardo Neves Gouveia, Ana Paias, Dushyant Sharma
Modeling and solving the rooted distance-constrained minimum spanning tree problem. Comput. Oper. Res. 35 (2) (2008)
Christophe Duhamel, Luis Eduardo Neves Gouveia, Pedro Moura, Maurício C. de Souza
Models and heuristics for a minimum arborescence problem. Networks 51 (1) (2008)
Maria Teresa Godinho, Luis Eduardo Neves Gouveia, Thomas L. Magnanti
Combined route capacity and route length models for unit demand vehicle routing problems. Discret. Optim. 5 (2) (2008)
Luis Eduardo Neves Gouveia, Stefan Voß
Preface. Networks 49 (1) (2007)
Walid Ben-Ameur, Luis Eduardo Neves Gouveia
Preface. Networks 50 (1) (2007)
Miguel Fragoso Constantino, Luis Eduardo Neves Gouveia
Reformulation by discretization: Application to economic lot sizing. Oper. Res. Lett. 35 (5) (2007)
Margarida Corte-Real, Luis Eduardo Neves Gouveia
Network flow models for the local access network expansion problem. Comput. Oper. Res. 34 (4) (2007)
Luis Eduardo Neves Gouveia, Francisco Saldanha-da-Gama
On the capacitated concentrator location problem: a reformulation by discretization. Comput. Oper. Res. 33 (2006)
Luis Eduardo Neves Gouveia, Thomas L. Magnanti, Cristina Requejo
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. Ann. Oper. Res. 146 (1) (2006)
Walid Ben-Ameur, Luis Eduardo Neves Gouveia
Further contributions to network optimization. Networks 48 (1) (2006)
Luis Eduardo Neves Gouveia, Pierre Pesneau
On extended formulations for the precedence constrained asymmetric traveling salesman problem. Networks 48 (2) (2006)
Luis Eduardo Neves Gouveia, Maria João Lopes
The capacitated minimum spanning tree problem: On improved multistar constraints. Eur. J. Oper. Res. 160 (1) (2005)
Luis Eduardo Neves Gouveia, Pedro Martins
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations. Comput. Oper. Res. 32 (2005)
Geir Dahl, Njål Foldnes, Luis Eduardo Neves Gouveia
A note on hop-constrained walk polytopes. Oper. Res. Lett. 32 (4) (2004)
Luis Eduardo Neves Gouveia, Thomas L. Magnanti, Cristina Requejo
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. Networks 44 (4) (2004)
Geir Dahl, Luis Eduardo Neves Gouveia
On the directed hop-constrained shortest path problem. Oper. Res. Lett. 32 (1) (2004)
Walid Ben-Ameur, Luis Eduardo Neves Gouveia
Some recent contributions to network optimization. Networks 44 (1) (2004)
Luis Eduardo Neves Gouveia, Pedro Patrício, Amaro de Sousa, Rui Valadas
MPLS over WDM Network Design with Packet Level QoS Constraints based on ILP Models. INFOCOM (2003)
Luis Eduardo Neves Gouveia, Thomas L. Magnanti
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Networks 41 (3) (2003)
Luis Eduardo Neves Gouveia, Leslie A. Hall
Multistars and directed flow formulations. Networks 40 (4) (2002)
Luis Eduardo Neves Gouveia, Cristina Requejo
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. Eur. J. Oper. Res. 132 (3) (2001)
Luis Eduardo Neves Gouveia, Jose Manuel Pires
The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints. Discret. Appl. Math. 112 (1-3) (2001)
Luis Eduardo Neves Gouveia, João Telhada
An Augmented Arborescence Formulation for the Two-Level Network Design Problem. Ann. Oper. Res. 106 (1-4) (2001)
Luis Eduardo Neves Gouveia, Jose Manuel Pires
Models for a Steiner ring network design problem with revenues. Eur. J. Oper. Res. 133 (1) (2001)
Luis Eduardo Neves Gouveia, Pedro Martins
A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem. Networks 35 (1) (2000)

Luis Eduardo Neves Gouveia.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Luis Eduardo Neves Gouveia