Gouveia Lus

Lus Gouveia

Information about the author Lus Gouveia will soon be added to the site.
Found 7 papers in total
Enhancing discretized formulations: the knapsack reformulation and the star reformulation
2012
Discretized formulations have proved to be useful for modeling combinatorial...
Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models
2011
Given an undirected network with link capacities and a set of commodities with known...
Network flow models for the local access network expansion problem
2007
In the local access network expansion problem we need to expand a given network (with...
On the capacitated concentrator location problem: a reformulation by discretization
2006
In this paper, we present and discuss a discretized model for the two versions of the...
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem
2001
We present a new Lagrangean relaxation for the hop-constrained minimum spanning tree...
Models for a Steiner ring network design problem with revenues
2001
Consider a graph G = ( V,E ), where the set of nodes V is partitioned into two sets,...
A comparative analysis of models for the Traveling Salesman Problem
1996
Several formulations for the Traveling Salesman Problem are compared with respect to...
Papers per page: