| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Luis Gouveia, Maria Grazia Scutellà |
Editorial.  |
Networks  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Ana Paias, Dushyant Sharma |
Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem. |
J. Heuristics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís Gouveia, Pedro Moura, Amaro de Sousa |
Prize collecting Steiner trees with node degree dependent costs. |
Computers & OR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Ana Paias, Stefan Voß |
Models for a traveling purchaser problem with additional side-constraints. |
Computers & OR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Luidi Simonetti, Eduardo Uchoa |
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. |
Math. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís Gouveia, João Telhada |
Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves. |
INOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís Gouveia, Pedro Moura, Amaro de Sousa |
Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks. |
INOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Gollowitzer, Luís Gouveia, Ivana Ljubic |
The Two Level Network Design Problem with Secondary Hop Constraints. |
INOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Stefan Gollowitzer, Luis Gouveia, Ivana Ljubic |
A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes. |
INOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís Gouveia, Pedro Patrício, Amaro de Sousa |
Lexicographical Minimization of Routing Hops in Telecommunication Networks. |
INOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Paola Cappanera, Luís Gouveia, Maria Grazia Scutellà |
The Skill Vehicle Routing Problem. |
INOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís Gouveia, Juan José Salazar González |
On the Vehicle Routing Problem with lower bound capacities. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís Gouveia, Pedro Moura |
Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Teresa Godinho, Luis Gouveia, Pierre Pesneau |
Hop-indexed Circuit-based formulations for the Traveling Salesman Problem. |
Electronic Notes in Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernard Fortz, Luis Gouveia |
Editorial. |
Networks |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Margarida Corte-Real, Luís Gouveia |
A node rooted flow-based model for the local access network expansion problem. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Isabel Correia, Luís Gouveia, Francisco Saldanha-da-Gama |
Discretized formulations for capacitated location problems with modular distribution costs. |
European Journal of Operational Research |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís Gouveia, Maria Cândida Mourão, Leonor Santiago Pinto |
Lower bounds for the mixed capacitated arc routing problem. |
Computers & OR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Agostinho Agra, Luis Gouveia, Cristina Requejo |
Extended formulations for the cardinality constrained subtree of a tree problem. |
Oper. Res. Lett. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia |
Preface. |
Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria Teresa Godinho, Luis Gouveia, Thomas L. Magnanti |
Combined route capacity and route length models for unit demand vehicle routing problems. |
Discrete Optimization |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christophe Duhamel, Luís Gouveia, Pedro Moura, Maurício C. de Souza |
Models and heuristics for a minimum arborescence problem. |
Networks |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Ana Paias, Dushyant Sharma |
Modeling and solving the rooted distance-constrained minimum spanning tree problem. |
Computers & OR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Isabel Correia, Luís Gouveia, Francisco Saldanha-da-Gama |
Solving the variable size bin packing problem with discretized formulations. |
Computers & OR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, João Telhada |
The multi-weighted Steiner tree problem: A reformulation by intersection. |
Computers & OR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Miguel Constantino, Luis Gouveia |
Reformulation by discretization: Application to economic lot sizing. |
Oper. Res. Lett. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Luis Gouveia |
Preface. |
Networks |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Stefan Voß |
Preface. |
Networks |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Margarida Corte-Real, Luís Gouveia |
Network flow models for the local access network expansion problem. |
Computers & OR |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Luis Gouveia |
Further contributions to network optimization. |
Networks |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Pierre Pesneau |
On extended formulations for the precedence constrained asymmetric traveling salesman problem. |
Networks |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Thomas L. Magnanti, Cristina Requejo |
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. |
Annals OR |
2006 |
DBLP DOI BibTeX RDF |
Diameter constrained trees, Hop-indexed models, Network flows |
| 1 | Luís Gouveia, Francisco Saldanha-da-Gama |
On the capacitated concentrator location problem: a reformulation by discretization. |
Computers & OR |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís Gouveia, Maria João Lopes |
The capacitated minimum spanning tree problem: On improved multistar constraints. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Pedro Martins |
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations. |
Computers & OR |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Geir Dahl, Njål Foldnes, Luis Gouveia |
A note on hop-constrained walk polytopes. |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Geir Dahl, Luis Gouveia |
On the directed hop-constrained shortest path problem. |
Oper. Res. Lett. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Thomas L. Magnanti, Cristina Requejo |
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. |
Networks |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Walid Ben-Ameur, Luis Gouveia |
Some recent contributions to network optimization. |
Networks |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Thomas L. Magnanti |
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. |
Networks |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís 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 |
DBLP BibTeX RDF |
|
| 1 | Luis Gouveia, Leslie A. Hall |
Multistars and directed flow formulations. |
Networks |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Jose Manuel Pires |
Models for a Steiner ring network design problem with revenues. |
European Journal of Operational Research |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Cristina Requejo |
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. |
European Journal of Operational Research |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, João Telhada |
An Augmented Arborescence Formulation for the Two-Level Network Design Problem. |
Annals OR |
2001 |
DBLP DOI BibTeX RDF |
spanning trees and steiner trees, multicommodity flow models, network design, linear programming relaxations |
| 1 | Luis Gouveia, Jose Manuel Pires |
The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Pedro Martins |
A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem. |
Networks |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís Gouveia, Maria João Lopes |
Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs. |
European Journal of Operational Research |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia, Jose Manuel Pires |
The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints. |
European Journal of Operational Research |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia |
Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints. |
INFORMS Journal on Computing |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Luís Gouveia, Maria João Lopes |
Using generalized capacitated trees for designing the topology of local access networks. |
Telecommunication Systems |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia |
Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints. |
Computers & OR |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Luis Gouveia |
A comparison of directed formulations for the capacitated minimal spanning tree problem. |
Telecommunication Systems |
1993 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")