| 2009 |
|---|
| 23 | EE | Luis Gouveia:
Preface.
Networks 53(2): 89-90 (2009) |
| 2008 |
|---|
| 22 | EE | Luis Gouveia,
João Telhada:
The multi-weighted Steiner tree problem: A reformulation by intersection.
Computers & OR 35(11): 3599-3611 (2008) |
| 21 | EE | Luis Gouveia,
Ana Paias,
Dushyant Sharma:
Modeling and solving the rooted distance-constrained minimum spanning tree problem.
Computers & OR 35(2): 600-613 (2008) |
| 20 | EE | Maria Teresa Godinho,
Luis Gouveia,
Thomas L. Magnanti:
Combined route capacity and route length models for unit demand vehicle routing problems.
Discrete Optimization 5(2): 350-372 (2008) |
| 19 | EE | Christophe Duhamel,
Luis Gouveia,
Pedro Moura,
Mauricio Souza:
Models and heuristics for a minimum arborescence problem.
Networks 51(1): 34-47 (2008) |
| 2007 |
|---|
| 18 | EE | Luis Gouveia,
Stefan Voß:
Preface.
Networks 49(1): 1-2 (2007) |
| 17 | EE | Walid Ben-Ameur,
Luis Gouveia:
Preface.
Networks 50(1): 1-2 (2007) |
| 16 | EE | Miguel Constantino,
Luis Gouveia:
Reformulation by discretization: Application to economic lot sizing.
Oper. Res. Lett. 35(5): 645-650 (2007) |
| 2006 |
|---|
| 15 | EE | Luis Gouveia,
Thomas L. Magnanti,
Cristina Requejo:
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees.
Annals OR 146(1): 19-39 (2006) |
| 14 | EE | Walid Ben-Ameur,
Luis Gouveia:
Further contributions to network optimization.
Networks 48(1): 1-6 (2006) |
| 13 | EE | Luis Gouveia,
Pierre Pesneau:
On extended formulations for the precedence constrained asymmetric traveling salesman problem.
Networks 48(2): 77-89 (2006) |
| 2005 |
|---|
| 12 | EE | Luis Gouveia,
Pedro Martins:
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations.
Computers & OR 32: 2435-2452 (2005) |
| 2004 |
|---|
| 11 | EE | Walid Ben-Ameur,
Luis Gouveia:
Some recent contributions to network optimization.
Networks 44(1): 27-30 (2004) |
| 10 | EE | Luis Gouveia,
Thomas L. Magnanti,
Cristina Requejo:
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees.
Networks 44(4): 254-265 (2004) |
| 9 | EE | Geir Dahl,
Luis Gouveia:
On the directed hop-constrained shortest path problem.
Oper. Res. Lett. 32(1): 15-22 (2004) |
| 8 | EE | Geir Dahl,
Njål Foldnes,
Luis Gouveia:
A note on hop-constrained walk polytopes.
Oper. Res. Lett. 32(4): 345-349 (2004) |
| 2003 |
|---|
| 7 | EE | Luis 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 |
| 6 | EE | Luis Gouveia,
Thomas L. Magnanti:
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees.
Networks 41(3): 159-173 (2003) |
| 2002 |
|---|
| 5 | EE | Luis Gouveia,
Leslie A. Hall:
Multistars and directed flow formulations.
Networks 40(4): 188-201 (2002) |
| 2001 |
|---|
| 4 | EE | Luis Gouveia,
João Telhada:
An Augmented Arborescence Formulation for the Two-Level Network Design Problem.
Annals OR 106(1-4): 47-61 (2001) |
| 3 | | Luis Gouveia,
Jose Manuel Pires:
The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints.
Discrete Applied Mathematics 112(1-3): 129-145 (2001) |
| 2000 |
|---|
| 2 | EE | Luis Gouveia,
Pedro Martins:
A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem.
Networks 35(1): 1-16 (2000) |
| 1995 |
|---|
| 1 | EE | Luis Gouveia:
Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints.
Computers & OR 22(9): 959-970 (1995) |
