Dynamic programming based heuristics for the topological design of local access networks. - Luis Eduardo Neves Gouveia; José Pinto Paixão (Ann. Oper. Res., 1991)

A comparison of directed formulations for the capacitated minimal spanning tree problem. - Luis Eduardo Neves Gouveia (Telecommun. Syst., 1993)

Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints. - Luis Eduardo Neves Gouveia (Comput. Oper. Res., 1995)

A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem. - Luis Eduardo Neves Gouveia (Oper. Res., 1995)

Using generalized capacitated trees for designing the topology of local access networks. - Luis Eduardo Neves Gouveia; Maria João Lopes (Telecommun. Syst., 1997)

Designing reliable tree networks with two cable technologies. - Luis Eduardo Neves Gouveia; Eric Janssen (Eur. J. Oper. Res., 1998)

Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints. - Luis Eduardo Neves Gouveia (INFORMS J. Comput., 1998)

The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexedmodel. - Luis Eduardo Neves Gouveia; Pedro Martins 002 (Ann. Oper. Res., 1999)

The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints. - Luis Eduardo Neves Gouveia; Jose Manuel Pires (Eur. J. Oper. Res., 1999)

Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs. - Luis Eduardo Neves Gouveia; Maria João Lopes (Eur. J. Oper. Res., 2000)

A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem. - Luis Eduardo Neves Gouveia; Pedro Martins 002 (Networks, 2000)

An Augmented Arborescence Formulation for the Two-Level Network Design Problem. - Luis Eduardo Neves Gouveia; João Telhada (Ann. Oper. Res., 2001)

The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints. - Luis Eduardo Neves Gouveia; Jose Manuel Pires (Discret. Appl. Math., 2001)

Models for a Steiner ring network design problem with revenues. - Luis Eduardo Neves Gouveia; Jose Manuel Pires (Eur. J. Oper. Res., 2001)

A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. - Luis Eduardo Neves Gouveia; Cristina Requejo (Eur. J. Oper. Res., 2001)

Multistars and directed flow formulations. - Luis Eduardo Neves Gouveia; Leslie A. Hall (Networks, 2002)

MPLS over WDM Network Design with Packet Level QoS Constraints based on ILP Models. - Luis Eduardo Neves Gouveia; Pedro Patrício; Amaro de Sousa; Rui Valadas (INFOCOM, 2003)

Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. - Luis Eduardo Neves Gouveia; Thomas L. Magnanti (Networks, 2003)

Some recent contributions to network optimization. - Walid Ben-Ameur; Luis Eduardo Neves Gouveia (Networks, 2004)

A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. - Luis Eduardo Neves Gouveia; Thomas L. Magnanti; Cristina Requejo (Networks, 2004)

A note on hop-constrained walk polytopes. - Geir Dahl; Njål Foldnes; Luis Eduardo Neves Gouveia (Oper. Res. Lett., 2004)

On the directed hop-constrained shortest path problem. - Geir Dahl; Luis Eduardo Neves Gouveia (Oper. Res. Lett., 2004)

The capacitated minimum spanning tree problem: revisiting hop-indexed formulations. - Luis Eduardo Neves Gouveia; Pedro Martins 002 (Comput. Oper. Res., 2005)

The capacitated minimum spanning tree problem: On improved multistar constraints. - Luis Eduardo Neves Gouveia; Maria João Lopes (Eur. J. Oper. Res., 2005)

On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem. - Geir Dahl; Luis Eduardo Neves Gouveia; Cristina Requejo (Handbook of Optimization in Telecommunications, 2006)

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. - Luis Eduardo Neves Gouveia; Thomas L. Magnanti; Cristina Requejo (Ann. Oper. Res., 2006)

On the capacitated concentrator location problem: a reformulation by discretization. - Luis Eduardo Neves Gouveia; Francisco Saldanha-da-Gama (Comput. Oper. Res., 2006)

Further contributions to network optimization. - Walid Ben-Ameur; Luis Eduardo Neves Gouveia (Networks, 2006)

On extended formulations for the precedence constrained asymmetric traveling salesman problem. - Luis Eduardo Neves Gouveia; Pierre Pesneau (Networks, 2006)

Network flow models for the local access network expansion problem. - Margarida Corte-Real; Luis Eduardo Neves Gouveia (Comput. Oper. Res., 2007)

Preface. - Walid Ben-Ameur; Luis Eduardo Neves Gouveia (Networks, 2007)

Preface. - Luis Eduardo Neves Gouveia; Stefan Voß 001 (Networks, 2007)

Reformulation by discretization: Application to economic lot sizing. - Miguel Fragoso Constantino; Luis Eduardo Neves Gouveia (Oper. Res. Lett., 2007)

Solving the variable size bin packing problem with discretized formulations. - Isabel Correia 001; Luis Eduardo Neves Gouveia; Francisco Saldanha-da-Gama (Comput. Oper. Res., 2008)

Modeling and solving the rooted distance-constrained minimum spanning tree problem. - Luis Eduardo Neves Gouveia; Ana Paias; Dushyant Sharma (Comput. Oper. Res., 2008)

The multi-weighted Steiner tree problem: A reformulation by intersection. - Luis Eduardo Neves Gouveia; João Telhada (Comput. Oper. Res., 2008)

Combined route capacity and route length models for unit demand vehicle routing problems. - Maria Teresa Godinho; Luis Eduardo Neves Gouveia; Thomas L. Magnanti (Discret. Optim., 2008)

Models and heuristics for a minimum arborescence problem. - Christophe Duhamel; Luis Eduardo Neves Gouveia; Pedro Moura 002; Maurício C. de Souza (Networks, 2008)

Preface. - Luis Eduardo Neves Gouveia (Networks, 2009)

Extended formulations for the cardinality constrained subtree of a tree problem. - Agostinho Agra; Luis Eduardo Neves Gouveia; Cristina Requejo (Oper. Res. Lett., 2009)

Lower bounds for the mixed capacitated arc routing problem. - Luis Eduardo Neves Gouveia; Maria Cândida Mourão; Leonor Santiago Pinto (Comput. Oper. Res., 2010)

Hop-indexed Circuit-based formulations for the Traveling Salesman Problem. - Maria Teresa Godinho; Luis Eduardo Neves Gouveia; Pierre Pesneau (Electron. Notes Discret. Math., 2010)

Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations. - Luis Eduardo Neves Gouveia; Pedro Moura 002 (Electron. Notes Discret. Math., 2010)

On the Vehicle Routing Problem with lower bound capacities. - Luis Eduardo Neves Gouveia; Juan José Salazar González (Electron. Notes Discret. Math., 2010)

Discretized formulations for capacitated location problems with modular distribution costs. - Isabel Correia 001; Luis Eduardo Neves Gouveia; Francisco Saldanha-da-Gama (Eur. J. Oper. Res., 2010)

A node rooted flow-based model for the local access network expansion problem. - Margarida Corte-Real; Luis Eduardo Neves Gouveia (Eur. J. Oper. Res., 2010)

The Skill Vehicle Routing Problem. - Paola Cappanera; Luis Eduardo Neves Gouveia; Maria Grazia Scutellà (INOC, 2011)

A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes. - Stefan Gollowitzer; Luis Eduardo Neves Gouveia; Ivana Ljubic (INOC, 2011)

The Two Level Network Design Problem with Secondary Hop Constraints. - Stefan Gollowitzer; Luis Eduardo Neves Gouveia; Ivana Ljubic (INOC, 2011)

Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks. - Luis Eduardo Neves Gouveia; Pedro Moura 002; Amaro de Sousa (INOC, 2011)

Lexicographical Minimization of Routing Hops in Telecommunication Networks. - Luis Eduardo Neves Gouveia; Pedro Patrício; Amaro de Sousa (INOC, 2011)

Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves. - Luis Eduardo Neves Gouveia; João Telhada (INOC, 2011)

Prize collecting Steiner trees with node degree dependent costs. - Luis Eduardo Neves Gouveia; Pedro Moura 002; Amaro de Sousa (Comput. Oper. Res., 2011)

Models for a traveling purchaser problem with additional side-constraints. - Luis Eduardo Neves Gouveia; Ana Paias; Stefan Voß 001 (Comput. Oper. Res., 2011)

Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem. - Luis Eduardo Neves Gouveia; Ana Paias; Dushyant Sharma (J. Heuristics, 2011)

Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models. - Luis Eduardo Neves Gouveia; Pedro Patrício; Amaro de Sousa (Int. Trans. Oper. Res., 2011)

Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. - Luis Eduardo Neves Gouveia; Luidi Simonetti; Eduardo Uchoa (Math. Program., 2011)

On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes. - Luis Eduardo Neves Gouveia; Markus Leitner; Ivana Ljubic (ISCO, 2012)

Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs. - Christophe Duhamel; Luis Eduardo Neves Gouveia; Pedro Moura 002; Maurício C. de Souza (Networks, 2012)

Reload cost trees and network design. - Ioannis Gamvros; Luis Eduardo Neves Gouveia; S. Raghavan 001 (Networks, 2012)

Editorial. - Luis Eduardo Neves Gouveia; Maria Grazia Scutellà (Networks, 2012)

SI on computational methods for network optimization problems. - Bernard Fortz; Luis Eduardo Neves Gouveia (EURO J. Comput. Optim., 2013)

Models and valid inequalities to asymmetric skill-based routing problems. - Paola Cappanera; Luis Eduardo Neves Gouveia; Maria Grazia Scutellà (EURO J. Transp. Logist., 2013)

Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities. - Stefan Gollowitzer; Luis Eduardo Neves Gouveia; Ivana Ljubic (Eur. J. Oper. Res., 2013)

Benders Decomposition for the Hop-Constrained Survivable Network Design Problem. - Quentin Botton; Bernard Fortz; Luis Eduardo Neves Gouveia; Michael Poss (INFORMS J. Comput., 2013)

Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route. - Luis Eduardo Neves Gouveia; Jorge Riera-Ledesma; Juan José Salazar González (Networks, 2013)

Editorial. - Luis Eduardo Neves Gouveia; Stefan Voß 001 (Networks, 2013)

Polynomial-time separation of Enhanced Reverse Multistar inequalities. - Luis Eduardo Neves Gouveia; Juan José Salazar González (Oper. Res. Lett., 2013)

Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol. - Bernard Fortz; Luis Eduardo Neves Gouveia; Martim Moniz (ISCO, 2014)

An improved decomposition-based heuristic to design a water distribution network for an irrigation system. - Graça Marques Gonçalves; Luis Eduardo Neves Gouveia; Margarida Vaz Pato (Ann. Oper. Res., 2014)

Natural and extended formulations for the Time-Dependent Traveling Salesman Problem. - Maria Teresa Godinho; Luis Eduardo Neves Gouveia; Pierre Pesneau (Discret. Appl. Math., 2014)

Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? - Tolga Bektas; Luis Eduardo Neves Gouveia (Eur. J. Oper. Res., 2014)

Hop constrained Steiner trees with multiple root nodes. - Luis Eduardo Neves Gouveia; Markus Leitner; Ivana Ljubic (Eur. J. Oper. Res., 2014)

Spanning trees with variable degree bounds. - Luis Eduardo Neves Gouveia; Pedro Moura 002; Mario Ruthmair; Amaro de Sousa (Eur. J. Oper. Res., 2014)

A comparison of several models for the hamiltonian p-median problem. - Stefan Gollowitzer; Luis Eduardo Neves Gouveia; Gilbert Laporte; Dilson Lucas Pereira; Adam Wojciechowski (Networks, 2014)

On the hop-constrained survivable network design problem with reliable edges. - Quentin Botton; Bernard Fortz; Luis Eduardo Neves Gouveia (Comput. Oper. Res., 2015)

Load-dependent and precedence-based models for pickup and delivery problems. - Luis Eduardo Neves Gouveia; Mario Ruthmair (Comput. Oper. Res., 2015)

Solving the maximum edge-weight clique problem in sparse graphs with compact formulations. - Luis Eduardo Neves Gouveia; Pedro Martins 002 (EURO J. Comput. Optim., 2015)

Improved integer linear programming formulations for the job Sequencing and tool Switching Problem. - Daniele Catanzaro; Luis Eduardo Neves Gouveia; Martine Labbé (Eur. J. Oper. Res., 2015)

The mixed capacitated arc routing problem with non-overlapping routes. - Miguel Fragoso Constantino; Luis Eduardo Neves Gouveia; Maria Cândida Mourão; Ana Catarina Nunes (Eur. J. Oper. Res., 2015)

Single PON network design with unconstrained splitting stages. - Luis Eduardo Neves Gouveia; Maria João Lopes; Amaro de Sousa (Eur. J. Oper. Res., 2015)

The two-level diameter constrained spanning tree problem. - Luis Eduardo Neves Gouveia; Markus Leitner; Ivana Ljubic (Math. Program., 2015)

On the convex piecewise linear unsplittable multicommodity flow problem. - Bernard Fortz; Luis Eduardo Neves Gouveia; Martim Joyce-Moniz (DRCN, 2016)

Maximization of protected demand in telecommunication networks using partial disjoint paths. - Amaro de Sousa; Luis Eduardo Neves Gouveia; Pedro Patrício (RNDM, 2016)

Preface. - Luis Eduardo Neves Gouveia; Andrea Lodi 001; Ali Ridha Mahjoub (Discret. Optim., 2016)

Editorial. - Bernard Fortz; Luis Eduardo Neves Gouveia (EURO J. Comput. Optim., 2016)

Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. - I. Diarrassouba; Virginie Gabrel; Ali Ridha Mahjoub; Luis Eduardo Neves Gouveia; Pierre Pesneau (Networks, 2016)

Lexicographical minimization of routing hops in hop-constrained node survivable networks. - Luis Eduardo Neves Gouveia; Pedro Patrício; Amaro de Sousa (Telecommun. Syst., 2016)

Spanning trees with a constraint on the number of leaves. A new formulation. - Luis Gouveia 001; Luidi Simonetti (Comput. Oper. Res., 2017)

Models for the piecewise linear unsplittable multicommodity flow problems. - Bernard Fortz; Luis Eduardo Neves Gouveia; Martim Joyce-Moniz (Eur. J. Oper. Res., 2017)

Design of survivable networks with vulnerability constraints. - Luis Gouveia 001; Markus Leitner (Eur. J. Oper. Res., 2017)

Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem. - Luis Eduardo Neves Gouveia; Markus Leitner; Mario Ruthmair (Eur. J. Oper. Res., 2017)

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

Preface: Static and dynamic optimization models for network routing problems. - Luis Eduardo Neves Gouveia; Michal Pióro; Jacek Rak (Networks, 2017)

Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems. - Bernard Gendron; Luis Eduardo Neves Gouveia (Transp. Sci., 2017)

The 2 edge-disjoint 3-paths polyhedron. - Quentin Botton; Bernard Fortz; Luis Gouveia 001 (Ann. des Télécommunications, 2018)

Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints. - Luís Gouveia 001; Martim Joyce-Moniz; Markus Leitner (Comput. Oper. Res., 2018)

Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol. - Bernard Fortz; Luís Gouveia 001; Martim Joyce-Moniz (Discret. Appl. Math., 2018)

Preface. - Luís Gouveia 001; Pedro Moura 002 (Electron. Notes Discret. Math., 2018)

New advances and applications in deterministic and stochastic network optimization. - Luis Gouveia 001; Pedro Moura 002 (Networks, 2018)

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)

Layered graph approaches for combinatorial optimization problems. - Luis Gouveia 001; Markus Leitner; Mario Ruthmair (Comput. Oper. Res., 2019)

Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm. - Tolga Bektas; Luis Gouveia 001; Antonio Martinez-Sykora; Juan José Salazar González (Eur. J. Oper. Res., 2019)

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)

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

A polyhedral study of the diameter constrained minimum spanning tree problem. - Luis Gouveia 001; Markus Leitner; Ivana Ljubic (Discret. Appl. Math., 2020)

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]. - Luis Gouveia 001; Markus Leitner; Mario Ruthmair; Ruslan Sadykov (Eur. J. Oper. Res., 2020)

Introduction to Special Issue. - Luis Gouveia 001; Seán McGarraghy; Cathal MacSwiney Brugha (Eur. J. Oper. Res., 2021)

Preface: Special issue on network analytics and optimization. - Bernard Fortz; Luis Gouveia 001; Christina Büsing; Markus Leitner (Networks, 2021)

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)

A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints. - Bernard Fortz; Luis Gouveia 001; Pedro Moura 002 (Networks, 2022)

Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm. - Luís Gouveia 001; Markus Leitner; Mario Ruthmair (Transp. Sci., 2023)

The travelling salesman problem with positional consistency constraints: An application to healthcare services. - Luís Gouveia 001; Ana Paias; Mafalda Ponte (Eur. J. Oper. Res., 2023)

Node based compact formulations for the Hamiltonian p-median problem. - Michele Barbato; Francisco Canas; Luís Gouveia 001; Pierre Pesneau (Networks, 2023)

The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms. - Michele Barbato; Luís Gouveia 001 (Eur. J. Oper. Res., 2024)