Gouveia Luis

Luis Gouveia

Information about the author Luis Gouveia will soon be added to the site.
Found 29 papers in total
Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems
Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems
2017
We consider the piecewise linear multicommodity network flow problem with the addition...
A comparison of several models for the hamiltonian p-median problem
A comparison of several models for the hamiltonian p-median problem
2014
The Hamiltonian p‐median problem consists of determining p disjoint cycles of...
Enhanced formulations and branch‐and‐cut for the two level network design problem with transition facilities
Enhanced formulations and branch‐and‐cut for the two level network design problem with transition facilities
2013
We develop a branch‐and‐cut algorithm for solving the TLNDF. The...
Benders Decomposition for the Hop‐Constrained Survivable Network Design Problem
Benders Decomposition for the Hop‐Constrained Survivable Network Design Problem
2013
Given a graph with nonnegative edge weights and node pairs Q , we study the problem of...
Restricted dynamic programming based neighborhoods for the hop‐constrained minimum spanning tree problem
Restricted dynamic programming based neighborhoods for the hop‐constrained minimum spanning tree problem
2011
In this paper we develop, study and test new neighborhood structures for the...
Combined route capacity and route length models for unit demand vehicle routing problems
Combined route capacity and route length models for unit demand vehicle routing problems
2008
We consider two types of hop-indexed models for the unit-demand asymmetric Capacitated...
Modeling and solving the rooted distance-constrained minimum spanning tree problem
Modeling and solving the rooted distance-constrained minimum spanning tree problem
2008
In this paper we discuss models and methods for solving the rooted distance...
Reformulation by discretization: Application to economic lot sizing
Reformulation by discretization: Application to economic lot sizing
2007
In this paper we apply a discretization reformulation technique to the classical...
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees
2006
In a previous paper, Gouveia and Magnanti found diameter-constrained minimal spanning...
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations
2005
The capacitated minimum spanning tree problem is to find a minimum spanning tree with...
The capacitated minimum spanning tree problem: On improved multistar constraints
The capacitated minimum spanning tree problem: On improved multistar constraints
2005
In this paper, we propose a new set of valid inequalities for the Capacitated Minimum...
A note on hop-constrained walk polytopes
A note on hop-constrained walk polytopes
2004
A hop-constrained walk is a walk with at most H arcs. The cases H ⩽3 have been...
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees
2004
In a previous article, using underlying graph theoretical properties, Gouveia and...
On the directed hop-constrained shortest path problem
On the directed hop-constrained shortest path problem
2004
In this paper we discuss valid inequalities for the directed hop-constrained shortest...
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees
2003
We formulate and computationally test several models for the Diameter-Constrained...
An augmented arborescence formulation for the two-level network design problem
An augmented arborescence formulation for the two-level network design problem
2001
In this paper we discuss formulations for the Two Level Network Design (TLND) problem....
A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem
A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem
2000
The Capacitated Minimum Spanning Tree Problem (CMSTP) is to find a minimum spanning...
Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs
2000
We discuss valid inequalities for a variation of the capacitated minimum spanning tree...
The asymmetric travelling salesman problem and a reformulation of Miller–Tucker–Zemlin constraints
The asymmetric travelling salesman problem and a reformulation of Miller–Tucker–Zemlin constraints
1999
In this paper we compare the linear programming (LP) relaxations of several old and...
The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexed model
The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexed model
1999
The Capacitated Minimal Spanning Tree Problem (CMSTP) is to find a minimal spanning...
Designing reliable tree networks with two cable technologies
Designing reliable tree networks with two cable technologies
1998
In this paper we introduce a minimal spanning tree problem with generalized hop...
Minimal spanning trees with a constraint on the number of leaves
Minimal spanning trees with a constraint on the number of leaves
1998
In this paper we discuss minimal spanning trees with a constraint on the number of...
Multicommodity flow models for spanning trees with hop constraints
Multicommodity flow models for spanning trees with hop constraints
1996
In this paper we compare the linear programming relaxations of undirected and directed...
Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints
Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints
1998
We use variable redefinition to strengthen a multicommodity flow (MCF) model for...
Papers per page: