![]() | ![]() |
Luis Gouveia
List of publications from the DBLP Bibliography Server - FAQ
| 2012 | ||
|---|---|---|
| 53 | Luis Gouveia, Maria Grazia Scutellà: Editorial. Networks 59(1): 1-2 (2012) | |
| 2011 | ||
| 52 | Luís Gouveia, Pedro Patrício, Amaro de Sousa: Lexicographical Minimization of Routing Hops in Telecommunication Networks. INOC 2011: 216-229 | |
| 51 | Paola Cappanera, Luís Gouveia, Maria Grazia Scutellà: The Skill Vehicle Routing Problem. INOC 2011: 354-364 | |
| 50 | Stefan Gollowitzer, Luis Gouveia, Ivana Ljubic: A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes. INOC 2011: 57-70 | |
| 49 | Stefan Gollowitzer, Luís Gouveia, Ivana Ljubic: The Two Level Network Design Problem with Secondary Hop Constraints. INOC 2011: 71-76 | |
| 48 | Luís Gouveia, Pedro Moura, Amaro de Sousa: Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks. INOC 2011: 77-82 | |
| 47 | Luís Gouveia, João Telhada: Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves. INOC 2011: 83-91 | |
| 46 | Luís Gouveia, Pedro Moura, Amaro de Sousa: Prize collecting Steiner trees with node degree dependent costs. Computers & OR 38(1): 234-245 (2011) | |
| 45 | Luis Gouveia, Ana Paias, Stefan Voß: Models for a traveling purchaser problem with additional side-constraints. Computers & OR 38(2): 550-558 (2011) | |
| 44 | Luis Gouveia, Ana Paias, Dushyant Sharma: Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem. J. Heuristics 17(1): 23-37 (2011) | |
| 43 | 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. 128(1-2): 123-148 (2011) | |
| 2010 | ||
| 42 | Luís Gouveia, Maria Cândida Mourão, Leonor Santiago Pinto: Lower bounds for the mixed capacitated arc routing problem. Computers & OR 37(4): 692-699 (2010) | |
| 41 | Luís Gouveia, Juan José Salazar González: On the Vehicle Routing Problem with lower bound capacities. Electronic Notes in Discrete Mathematics 36: 1001-1008 (2010) | |
| 40 | Maria Teresa Godinho, Luis Gouveia, Pierre Pesneau: Hop-indexed Circuit-based formulations for the Traveling Salesman Problem. Electronic Notes in Discrete Mathematics 36: 1049-1056 (2010) | |
| 39 | Luís Gouveia, Pedro Moura: Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations. Electronic Notes in Discrete Mathematics 36: 985-992 (2010) | |
| 38 | Margarida Corte-Real, Luís Gouveia: A node rooted flow-based model for the local access network expansion problem. European Journal of Operational Research 204(1): 20-34 (2010) | |
| 37 | Isabel Correia, Luís Gouveia, Francisco Saldanha-da-Gama: Discretized formulations for capacitated location problems with modular distribution costs. European Journal of Operational Research 204(2): 237-244 (2010) | |
| 36 | Bernard Fortz, Luis Gouveia: Editorial. Networks 55(3): 169-170 (2010) | |
| 2009 | ||
| 35 | Luis Gouveia: Preface. Networks 53(2): 89-90 (2009) | |
| 34 | Agostinho Agra, Luis Gouveia, Cristina Requejo: Extended formulations for the cardinality constrained subtree of a tree problem. Oper. Res. Lett. 37(3): 192-196 (2009) | |
| 2008 | ||
| 33 | Luis Gouveia, João Telhada: The multi-weighted Steiner tree problem: A reformulation by intersection. Computers & OR 35(11): 3599-3611 (2008) | |
| 32 | Luis Gouveia, Ana Paias, Dushyant Sharma: Modeling and solving the rooted distance-constrained minimum spanning tree problem. Computers & OR 35(2): 600-613 (2008) | |
| 31 | Isabel Correia, Luís Gouveia, Francisco Saldanha-da-Gama: Solving the variable size bin packing problem with discretized formulations. Computers & OR 35(6): 2103-2113 (2008) | |
| 30 | 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) | |
| 29 | Christophe Duhamel, Luís Gouveia, Pedro Moura, Maurício C. de Souza: Models and heuristics for a minimum arborescence problem. Networks 51(1): 34-47 (2008) | |
| 2007 | ||
| 28 | Margarida Corte-Real, Luís Gouveia: Network flow models for the local access network expansion problem. Computers & OR 34(4): 1141-1157 (2007) | |
| 27 | Luis Gouveia, Stefan Voß: Preface. Networks 49(1): 1-2 (2007) | |
| 26 | Walid Ben-Ameur, Luis Gouveia: Preface. Networks 50(1): 1-2 (2007) | |
| 25 | Miguel Constantino, Luis Gouveia: Reformulation by discretization: Application to economic lot sizing. Oper. Res. Lett. 35(5): 645-650 (2007) | |
| 2006 | ||
| 24 | 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) | |
| 23 | Luís Gouveia, Francisco Saldanha-da-Gama: On the capacitated concentrator location problem: a reformulation by discretization. Computers & OR 33: 1242-1258 (2006) | |
| 22 | Walid Ben-Ameur, Luis Gouveia: Further contributions to network optimization. Networks 48(1): 1-6 (2006) | |
| 21 | Luis Gouveia, Pierre Pesneau: On extended formulations for the precedence constrained asymmetric traveling salesman problem. Networks 48(2): 77-89 (2006) | |
| 2005 | ||
| 20 | Luis Gouveia, Pedro Martins: The capacitated minimum spanning tree problem: revisiting hop-indexed formulations. Computers & OR 32: 2435-2452 (2005) | |
| 19 | Luís Gouveia, Maria João Lopes: The capacitated minimum spanning tree problem: On improved multistar constraints. European Journal of Operational Research 160(1): 47-62 (2005) | |
| 2004 | ||
| 18 | Walid Ben-Ameur, Luis Gouveia: Some recent contributions to network optimization. Networks 44(1): 27-30 (2004) | |
| 17 | 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) | |
| 16 | Geir Dahl, Luis Gouveia: On the directed hop-constrained shortest path problem. Oper. Res. Lett. 32(1): 15-22 (2004) | |
| 15 | Geir Dahl, Njål Foldnes, Luis Gouveia: A note on hop-constrained walk polytopes. Oper. Res. Lett. 32(4): 345-349 (2004) | |
| 2003 | ||
| 14 | 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 | |
| 13 | Luis Gouveia, Thomas L. Magnanti: Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Networks 41(3): 159-173 (2003) | |
| 2002 | ||
| 12 | Luis Gouveia, Leslie A. Hall: Multistars and directed flow formulations. Networks 40(4): 188-201 (2002) | |
| 2001 | ||
| 11 | Luis Gouveia, João Telhada: An Augmented Arborescence Formulation for the Two-Level Network Design Problem. Annals OR 106(1-4): 47-61 (2001) | |
| 10 | 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) | |
| 9 | Luis Gouveia, Cristina Requejo: A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. European Journal of Operational Research 132(3): 539-552 (2001) | |
| 8 | Luis Gouveia, Jose Manuel Pires: Models for a Steiner ring network design problem with revenues. European Journal of Operational Research 133(1): 21-31 (2001) | |
| 2000 | ||
| 7 | 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 121(2): 394-411 (2000) | |
| 6 | Luis Gouveia, Pedro Martins: A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem. Networks 35(1): 1-16 (2000) | |
| 1999 | ||
| 5 | Luis Gouveia, Jose Manuel Pires: The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints. European Journal of Operational Research 112(1): 134-146 (1999) | |
| 1998 | ||
| 4 | Luis Gouveia: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints. INFORMS Journal on Computing 10(2): 180-188 (1998) | |
| 1997 | ||
| 3 | Luís Gouveia, Maria João Lopes: Using generalized capacitated trees for designing the topology of local access networks. Telecommunication Systems 7(4): 315-337 (1997) | |
| 1995 | ||
| 2 | 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) | |
| 1993 | ||
| 1 | Luis Gouveia: A comparison of directed formulations for the capacitated minimal spanning tree problem. Telecommunication Systems 1(1): 51-76 (1993) | |
Colors in the list of coauthors
Last update Wed May 30 22:34:44 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page