Luis Eduardo Neves Gouveia

According to our database1, Luis Eduardo Neves Gouveia authored at least 107 papers between 1991 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

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].
Eur. J. Oper. Res., 2020

A polyhedral study of the diameter constrained minimum spanning tree problem.
Discret. Appl. Math., 2020

Compact formulations for multi-depot routing problems: Theoretical and computational comparisons.
Comput. Oper. Res., 2020

2019
Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm.
Eur. J. Oper. Res., 2019

Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm.
Eur. J. Oper. Res., 2019

Layered graph approaches for combinatorial optimization problems.
Comput. Oper. Res., 2019

2018
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem.
Networks, 2018

New advances and applications in deterministic and stochastic network optimization.
Networks, 2018

Preface.
Electron. Notes Discret. Math., 2018

Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol.
Discret. Appl. Math., 2018

Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints.
Comput. Oper. Res., 2018

The 2 edge-disjoint 3-paths polyhedron.
Ann. des Télécommunications, 2018

2017
Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems.
Transp. Sci., 2017

Preface: Static and dynamic optimization models for network routing problems.
Networks, 2017

New path elimination constraints for multi-depot routing problems.
Networks, 2017

Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem.
Eur. J. Oper. Res., 2017

Design of survivable networks with vulnerability constraints.
Eur. J. Oper. Res., 2017

Models for the piecewise linear unsplittable multicommodity flow problems.
Eur. J. Oper. Res., 2017

Spanning trees with a constraint on the number of leaves. A new formulation.
Comput. Oper. Res., 2017

2016
Lexicographical minimization of routing hops in hop-constrained node survivable networks.
Telecommun. Syst., 2016

Integer programming formulations for the <i>k</i>-edge-connected 3-hop-constrained network design problem.
Networks, 2016

Editorial.
EURO J. Comput. Optim., 2016

Preface.
Discret. Optim., 2016

Maximization of protected demand in telecommunication networks using partial disjoint paths.
Proceedings of the 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM), 2016

On the convex piecewise linear unsplittable multicommodity flow problem.
Proceedings of the 12th International Conference on the Design of Reliable Communication Networks, 2016

2015
The two-level diameter constrained spanning tree problem.
Math. Program., 2015

Single PON network design with unconstrained splitting stages.
Eur. J. Oper. Res., 2015

The mixed capacitated arc routing problem with non-overlapping routes.
Eur. J. Oper. Res., 2015

Improved integer linear programming formulations for the job Sequencing and tool Switching Problem.
Eur. J. Oper. Res., 2015

Solving the maximum edge-weight clique problem in sparse graphs with compact formulations.
EURO J. Comput. Optim., 2015

Load-dependent and precedence-based models for pickup and delivery problems.
Comput. Oper. Res., 2015

On the hop-constrained survivable network design problem with reliable edges.
Comput. Oper. Res., 2015

2014
A comparison of several models for the hamiltonian <i>p</i>-median problem.
Networks, 2014

Spanning trees with variable degree bounds.
Eur. J. Oper. Res., 2014

Hop constrained Steiner trees with multiple root nodes.
Eur. J. Oper. Res., 2014

Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?
Eur. J. Oper. Res., 2014

Natural and extended formulations for the Time-Dependent Traveling Salesman Problem.
Discret. Appl. Math., 2014

An improved decomposition-based heuristic to design a water distribution network for an irrigation system.
Ann. Oper. Res., 2014

Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
Polynomial-time separation of Enhanced Reverse Multistar inequalities.
Oper. Res. Lett., 2013

Editorial.
Networks, 2013

Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route.
Networks, 2013

Benders Decomposition for the Hop-Constrained Survivable Network Design Problem.
INFORMS J. Comput., 2013

Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities.
Eur. J. Oper. Res., 2013

Models and valid inequalities to asymmetric skill-based routing problems.
EURO J. Transp. Logist., 2013

SI on computational methods for network optimization problems.
EURO J. Comput. Optim., 2013

2012
Editorial.
Networks, 2012

Reload cost trees and network design.
Networks, 2012

Models and heuristics for the <i>k</i> -degree constrained minimum spanning tree problem with node-degree costs.
Networks, 2012

On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs.
Math. Program., 2011

Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models.
Int. Trans. Oper. Res., 2011

Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem.
J. Heuristics, 2011

Models for a traveling purchaser problem with additional side-constraints.
Comput. Oper. Res., 2011

Prize collecting Steiner trees with node degree dependent costs.
Comput. Oper. Res., 2011

Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves.
Proceedings of the Network Optimization - 5th International Conference, 2011

Lexicographical Minimization of Routing Hops in Telecommunication Networks.
Proceedings of the Network Optimization - 5th International Conference, 2011

Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks.
Proceedings of the Network Optimization - 5th International Conference, 2011

The Two Level Network Design Problem with Secondary Hop Constraints.
Proceedings of the Network Optimization - 5th International Conference, 2011

A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes.
Proceedings of the Network Optimization - 5th International Conference, 2011

The Skill Vehicle Routing Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

2010
A node rooted flow-based model for the local access network expansion problem.
Eur. J. Oper. Res., 2010

Discretized formulations for capacitated location problems with modular distribution costs.
Eur. J. Oper. Res., 2010

On the Vehicle Routing Problem with lower bound capacities.
Electron. Notes Discret. Math., 2010

Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations.
Electron. Notes Discret. Math., 2010

Hop-indexed Circuit-based formulations for the Traveling Salesman Problem.
Electron. Notes Discret. Math., 2010

Lower bounds for the mixed capacitated arc routing problem.
Comput. Oper. Res., 2010

2009
Extended formulations for the cardinality constrained subtree of a tree problem.
Oper. Res. Lett., 2009

Preface.
Networks, 2009

2008
Models and heuristics for a minimum arborescence problem.
Networks, 2008

Combined route capacity and route length models for unit demand vehicle routing problems.
Discret. Optim., 2008

The multi-weighted Steiner tree problem: A reformulation by intersection.
Comput. Oper. Res., 2008

Modeling and solving the rooted distance-constrained minimum spanning tree problem.
Comput. Oper. Res., 2008

Solving the variable size bin packing problem with discretized formulations.
Comput. Oper. Res., 2008

2007
Reformulation by discretization: Application to economic lot sizing.
Oper. Res. Lett., 2007

Preface.
Networks, 2007

Preface.
Networks, 2007

Network flow models for the local access network expansion problem.
Comput. Oper. Res., 2007

2006
On extended formulations for the precedence constrained asymmetric traveling salesman problem.
Networks, 2006

Further contributions to network optimization.
Networks, 2006

On the capacitated concentrator location problem: a reformulation by discretization.
Comput. Oper. Res., 2006

An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees.
Ann. Oper. Res., 2006

On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005
The capacitated minimum spanning tree problem: On improved multistar constraints.
Eur. J. Oper. Res., 2005

The capacitated minimum spanning tree problem: revisiting hop-indexed formulations.
Comput. Oper. Res., 2005

2004
On the directed hop-constrained shortest path problem.
Oper. Res. Lett., 2004

A note on hop-constrained walk polytopes.
Oper. Res. Lett., 2004

A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees.
Networks, 2004

Some recent contributions to network optimization.
Networks, 2004

2003
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees.
Networks, 2003

MPLS over WDM Network Design with Packet Level QoS Constraints based on ILP Models.
Proceedings of the Proceedings IEEE INFOCOM 2003, The 22nd Annual Joint Conference of the IEEE Computer and Communications Societies, San Franciso, CA, USA, March 30, 2003

2002
Multistars and directed flow formulations.
Networks, 2002

2001
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem.
Eur. J. Oper. Res., 2001

Models for a Steiner ring network design problem with revenues.
Eur. J. Oper. Res., 2001

The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints.
Discret. Appl. Math., 2001

An Augmented Arborescence Formulation for the Two-Level Network Design Problem.
Ann. Oper. Res., 2001

2000
A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem.
Networks, 2000

Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs.
Eur. J. Oper. Res., 2000

1999
The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints.
Eur. J. Oper. Res., 1999

The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexedmodel.
Ann. Oper. Res., 1999

1998
Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints.
INFORMS J. Comput., 1998

Designing reliable tree networks with two cable technologies.
Eur. J. Oper. Res., 1998

1997
Using generalized capacitated trees for designing the topology of local access networks.
Telecommun. Syst., 1997

1995
A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem.
Oper. Res., 1995

Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints.
Comput. Oper. Res., 1995

1993
A comparison of directed formulations for the capacitated minimal spanning tree problem.
Telecommun. Syst., 1993

1991
Dynamic programming based heuristics for the topological design of local access networks.
Ann. Oper. Res., 1991


  Loading...