×

zbMATH — the first resource for mathematics

Gouveia, Luis

Compute Distance To:
Author ID: gouveia.luis Recent zbMATH articles by "Gouveia, Luis"
Published as: Gouveia, L.; Gouveia, Luis; Gouveia, Luís
Homepage: https://ciencias.ulisboa.pt/en/perfil/legouveia
Documents Indexed: 105 Publications since 1991, including 5 Books

Publications by Year

Citations contained in zbMATH Open

80 Publications have been cited 767 times in 405 Documents Cited by Year
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. Zbl 1218.90201
Gouveia, Luis; Simonetti, Luidi; Uchoa, Eduardo
38
2011
Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints. Zbl 0854.90139
Gouveia, Luis
37
1995
A \(2n\) constraint formulation for the capacitated minimal spanning tree problem. Zbl 0830.90049
Gouveia, Luis
37
1995
Using variable redefinfition for computing lower bounds for minimum spanning and Steiner trees with Hop constraints. Zbl 1054.90622
Gouveia, Luis
36
1998
A classification of formulations for the (time-dependent) traveling salesman problem. Zbl 0903.90170
Gouveia, Luis; Voß, Stefan
36
1995
Multicommodity flow models for spanning trees with hop constraints. Zbl 0947.90513
Gouveia, Luis
34
1996
A result on projection for the vehicle routing problem. Zbl 0912.90118
Gouveia, Luis
31
1995
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Zbl 1106.90014
Gouveia, Luis; Magnanti, Thomas L.
27
2003
The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints. Zbl 0971.90099
Gouveia, Luis; Pires, Jose Manuel
24
1999
Solving the variable size bin packing problem with discretized formulations. Zbl 1139.90025
Correia, Isabel; Gouveia, Luís; Saldanha-da-Gama, Francisco
22
2008
On formulations and methods for the hop-constrained minimum spanning tree problem. Zbl 1118.90051
Dahl, Geir; Gouveia, Luis; Requejo, Cristina
21
2006
On the capacitated concentrator location problem: a reformulation by discretization. Zbl 1126.90377
Gouveia, Luís; Saldanha-da-Gama, Francisco
19
2006
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. Zbl 1055.90084
Gouveia, Luís; Requejo, Cristina
18
2001
Minimal spanning trees with a constraint on the number of leaves. Zbl 0957.90010
Fernandes, Lucinda Matos; Gouveia, Luis
17
1998
On extended formulations for the precedence constrained asymmetric traveling salesman problem. Zbl 1103.90084
Gouveia, L.; Pesneau, P.
16
2006
On the directed hop-constrained shortest path problem. Zbl 1056.90116
Dahl, Geir; Gouveia, Luis
15
2004
Load-dependent and precedence-based models for pickup and delivery problems. Zbl 1349.90087
Gouveia, Luis; Ruthmair, Mario
14
2015
Hop-constrained node survivable network design: An application to MPLS over WDM. Zbl 1172.90339
Gouveia, Luís; Patrício, Pedro; de Sousa, Amaro
14
2008
Modeling and solving the rooted distance-constrained minimum spanning tree problem. Zbl 1141.90031
Gouveia, Luis; Paias, Ana; Sharma, Dushyant
13
2008
The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints. Zbl 1054.90059
Gouveia, Luis; Pires, Jose Manuel
13
2001
Reload cost trees and network design. Zbl 1248.68379
Gamvros, Ioannis; Gouveia, Luis; Raghavan, S.
12
2012
A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem. Zbl 0938.90067
Gouveia, Luis; Martins, Pedro
12
2000
Lower bounds for the mixed capacitated arc routing problem. Zbl 1175.90039
Gouveia, Luís; Mourão, Maria Cândida; Pinto, Leonor Santiago
11
2010
The capacitated minimal spanning tree problem: An experiment with a hop-indexed model. Zbl 0921.90141
Gouveia, Luis; Martins, Pedro
11
1999
Natural and extended formulations for the time-dependent traveling salesman problem. Zbl 1331.90066
Godinho, Maria Teresa; Gouveia, Luis; Pesneau, Pierre
10
2014
Discretized formulations for capacitated location problems with modular distribution costs. Zbl 1178.90223
Correia, Isabel; Gouveia, Luís; Saldanha-da-Gama, Francisco
10
2010
Combined route capacity and route length models for unit demand vehicle routing problems. Zbl 1168.90359
Godinho, Maria Teresa; Gouveia, Luis; Magnanti, Thomas L.
10
2008
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. Zbl 1058.90069
Gouveia, Luis; Magnanti, Thomas L.; Requejo, Cristina
10
2004
Improved integer linear programming formulations for the job sequencing and tool switching problem. Zbl 1348.90485
Catanzaro, Daniele; Gouveia, Luis; Labbé, Martine
9
2015
Hop constrained Steiner trees with multiple root nodes. Zbl 1338.90266
Gouveia, Luis; Leitner, Markus; Ljubić, Ivana
9
2014
Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? Zbl 1304.90168
Bektaş, Tolga; Gouveia, Luis
9
2014
The two-level diameter constrained spanning tree problem. Zbl 1309.90065
Gouveia, Luis; Leitner, Markus; Ljubić, Ivana
8
2015
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations. Zbl 1307.90109
Gouveia, Luis; Martins, Pedro
7
2015
On a time-dependent formulation and an updated classification of ATSP formulations. Zbl 1263.90074
Godinho, Maria Teresa; Gouveia, Luis; Pesneau, Pierre
7
2012
Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities. Zbl 1292.90165
Gollowitzer, Stefan; Gouveia, Luis; Ljubić, Ivana
6
2013
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. Zbl 1107.90007
Gouveia, Luis; Magnanti, Thomas L.; Requejo, Cristina
6
2006
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations. Zbl 1066.90102
Gouveia, Luis; Martins, Pedro
6
2005
An augmented arborescence formulation for the two-level network design problem. Zbl 1019.90004
Gouveia, Luis; Telhada, João
6
2001
Dynamic programming based heuristics for the topological design of local access networks. Zbl 0736.90032
Gouveia, L.; Paixão, J.
6
1991
The mixed capacitated arc routing problem with non-overlapping routes. Zbl 1346.90091
Constantino, Miguel; Gouveia, Luís; Mourão, Maria Cândida; Nunes, Ana Catarina
5
2015
A comparison of several models for the Hamiltonian \(p\)-median problem. Zbl 1390.90585
Gollowitzer, Stefan; Gouveia, Luis; Laporte, Gilbert; Pereira, Dilson Lucas; Wojciechowski, Adam
5
2014
The skill vehicle routing problem. Zbl 1345.90090
Cappanera, Paola; Gouveia, Luís; Scutellà, Maria Grazia
5
2011
Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem. Zbl 1205.90288
Gouveia, Luis; Paias, Ana; Sharma, Dushyant
5
2011
Models for a traveling purchaser problem with additional side-constraints. Zbl 1231.90089
Gouveia, Luis; Paias, Ana; Voß, Stefan
5
2011
Prize collecting Steiner trees with node degree dependent costs. Zbl 1231.90368
Gouveia, Luís; Moura, Pedro; de Sousa, Amaro
5
2011
A note on hop-constrained walk polytopes. Zbl 1052.05033
Dahl, Geir; Foldnes, Njål; Gouveia, Luis
5
2004
Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs. Zbl 0959.90057
Gouveia, Luis; Lopes, Maria João
5
2000
Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem. Zbl 1375.90223
Gouveia, Luis; Leitner, Markus; Ruthmair, Mario
4
2017
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route. Zbl 1269.90010
Gouveia, Luis; Riera-Ledesma, Jorge; Salazar-González, Juan-José
4
2013
Enhancing discretized formulations: the knapsack reformulation and the star reformulation. Zbl 1261.68006
Gouveia, Luís; Moura, Pedro
4
2012
Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs. Zbl 1251.68169
Duhamel, Christophe; Gouveia, Luís; Moura, Pedro; De Souza, Maurício
4
2012
Spanning trees with node degree cependent costs and knapsack reformulations. Zbl 1274.90310
Gouveia, Luís; Moura, Pedro
4
2010
Reformulation by discretization: application to economic lot sizing. Zbl 1149.90106
Constantino, Miguel; Gouveia, Luis
4
2007
Models for a Steiner ring network design problem with revenues. Zbl 1006.90014
Gouveia, Luis; Pires, Jose Manuel
4
2001
Designing reliable tree networks with two cable technologies. Zbl 0955.90009
Gouveia, Luis; Janssen, Eric
4
1998
Layered graph approaches for combinatorial optimization problems. Zbl 1458.90612
Gouveia, Luis; Leitner, Markus; Ruthmair, Mario
3
2019
Branch-and-cut methods for the network design problem with vulnerability constraints. Zbl 1391.90147
Gouveia, Luís; Joyce-Moniz, Martim; Leitner, Markus
3
2018
Design of survivable networks with vulnerability constraints. Zbl 1380.90072
Gouveia, Luis; Leitner, Markus
3
2017
Profitable mixed capacitated arc routing and related problems. Zbl 1312.90012
Benavent, Enrique; Corberán, Ángel; Gouveia, Luís; Mourão, Maria Cândida; Pinto, Leonor Santiago
3
2015
Reformulation by intersection method on the MST problem with lower bound on the number of leaves. Zbl 1345.90093
Gouveia, Luís; Telhada, João
3
2011
The multi-weighted Steiner tree problem: A reformulation by intersection. Zbl 1171.90533
Gouveia, Luis; Telhada, João
3
2008
Models and heuristics for a minimum arborescence problem. Zbl 1175.90059
Duhamel, Christophe; Gouveia, Luis; Moura, Pedro; Souza, Mauricio
3
2008
Network flow models for the local access network expansion problem. Zbl 1102.90010
Corte-Real, Margarida; Gouveia, Luís
3
2007
The capacitated minimum spanning tree problem: On improved multistar constraints. Zbl 1067.90141
Gouveia, Luís; Lopes, Maria João
3
2005
Multistars and directed flow formulations. Zbl 1035.90097
Gouveia, Luis; Hall, Leslie
3
2002
An improved decomposition-based heuristic to design a water distribution network for an irrigation system. Zbl 1301.90009
Gonçalves, Graça Marques; Gouveia, Luís; Pato, Margarida Vaz
2
2014
Polynomial-time separation of enhanced reverse multistar inequalities. Zbl 1286.90017
Gouveia, Luis; Salazar-González, Juan-José
2
2013
A node splitting technique for two level network design problems with transition nodes. Zbl 1345.90091
Gollowitzer, Stefan; Gouveia, Luis; Ljubić, Ivana
2
2011
Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm. Zbl 1430.90371
Bektaş, Tolga; Gouveia, Luís; Santos, Daniel
1
2019
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem. Zbl 1394.90481
Gouveia, Luis; Pesneau, Pierre; Ruthmair, Mario; Santos, Daniel
1
2018
Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol. Zbl 1376.05143
Fortz, Bernard; Gouveia, Luís; Joyce-Moniz, Martim
1
2018
Spanning trees with a constraint on the number of leaves. A new formulation. Zbl 1391.90604
Gouveia, Luis; Simonetti, Luidi
1
2017
Integer programming formulations for the \(k\)-edge-connected 3-hop-constrained network design problem. Zbl 1390.90104
Diarrassouba, I.; Gabrel, V.; Mahjoub, A. R.; Gouveia, L.; Pesneau, P.
1
2016
Models for a Steiner multi-ring network design problem with revenues. Zbl 1350.90025
Bautzer, Ana; Gouveia, Luís; Paias, Ana; Pires, José Manuel
1
2016
On the hop-constrained survivable network design problem with reliable edges. Zbl 1349.90158
Botton, Quentin; Fortz, Bernard; Gouveia, Luis
1
2015
On the hop constrained Steiner tree problem with multiple root nodes. Zbl 1370.90216
Gouveia, Luis; Leitner, Markus; Ljubić, Ivana
1
2012
Lexicographical minimization of routing hops in telecommunication networks. Zbl 1345.90034
Gouveia, Luís; Patrício, Pedro; de Sousa, Amaro
1
2011
The two level network design problem with secondary hop constraints. Zbl 1345.90092
Gollowitzer, Stefan; Gouveia, Luís; Ljubić, Ivana
1
2011
Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models. Zbl 1219.90176
Gouveia, Luís; Patrício, Pedro; De Sousa, Amaro
1
2011
Extended formulations for the cardinality constrained subtree of a tree problem. Zbl 1167.90659
Agra, A.; Gouveia, L.; Requejo, C.
1
2009
Layered graph approaches for combinatorial optimization problems. Zbl 1458.90612
Gouveia, Luis; Leitner, Markus; Ruthmair, Mario
3
2019
Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm. Zbl 1430.90371
Bektaş, Tolga; Gouveia, Luís; Santos, Daniel
1
2019
Branch-and-cut methods for the network design problem with vulnerability constraints. Zbl 1391.90147
Gouveia, Luís; Joyce-Moniz, Martim; Leitner, Markus
3
2018
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem. Zbl 1394.90481
Gouveia, Luis; Pesneau, Pierre; Ruthmair, Mario; Santos, Daniel
1
2018
Optimal design of switched Ethernet networks implementing the multiple spanning tree protocol. Zbl 1376.05143
Fortz, Bernard; Gouveia, Luís; Joyce-Moniz, Martim
1
2018
Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem. Zbl 1375.90223
Gouveia, Luis; Leitner, Markus; Ruthmair, Mario
4
2017
Design of survivable networks with vulnerability constraints. Zbl 1380.90072
Gouveia, Luis; Leitner, Markus
3
2017
Spanning trees with a constraint on the number of leaves. A new formulation. Zbl 1391.90604
Gouveia, Luis; Simonetti, Luidi
1
2017
Integer programming formulations for the \(k\)-edge-connected 3-hop-constrained network design problem. Zbl 1390.90104
Diarrassouba, I.; Gabrel, V.; Mahjoub, A. R.; Gouveia, L.; Pesneau, P.
1
2016
Models for a Steiner multi-ring network design problem with revenues. Zbl 1350.90025
Bautzer, Ana; Gouveia, Luís; Paias, Ana; Pires, José Manuel
1
2016
Load-dependent and precedence-based models for pickup and delivery problems. Zbl 1349.90087
Gouveia, Luis; Ruthmair, Mario
14
2015
Improved integer linear programming formulations for the job sequencing and tool switching problem. Zbl 1348.90485
Catanzaro, Daniele; Gouveia, Luis; Labbé, Martine
9
2015
The two-level diameter constrained spanning tree problem. Zbl 1309.90065
Gouveia, Luis; Leitner, Markus; Ljubić, Ivana
8
2015
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations. Zbl 1307.90109
Gouveia, Luis; Martins, Pedro
7
2015
The mixed capacitated arc routing problem with non-overlapping routes. Zbl 1346.90091
Constantino, Miguel; Gouveia, Luís; Mourão, Maria Cândida; Nunes, Ana Catarina
5
2015
Profitable mixed capacitated arc routing and related problems. Zbl 1312.90012
Benavent, Enrique; Corberán, Ángel; Gouveia, Luís; Mourão, Maria Cândida; Pinto, Leonor Santiago
3
2015
On the hop-constrained survivable network design problem with reliable edges. Zbl 1349.90158
Botton, Quentin; Fortz, Bernard; Gouveia, Luis
1
2015
Natural and extended formulations for the time-dependent traveling salesman problem. Zbl 1331.90066
Godinho, Maria Teresa; Gouveia, Luis; Pesneau, Pierre
10
2014
Hop constrained Steiner trees with multiple root nodes. Zbl 1338.90266
Gouveia, Luis; Leitner, Markus; Ljubić, Ivana
9
2014
Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? Zbl 1304.90168
Bektaş, Tolga; Gouveia, Luis
9
2014
A comparison of several models for the Hamiltonian \(p\)-median problem. Zbl 1390.90585
Gollowitzer, Stefan; Gouveia, Luis; Laporte, Gilbert; Pereira, Dilson Lucas; Wojciechowski, Adam
5
2014
An improved decomposition-based heuristic to design a water distribution network for an irrigation system. Zbl 1301.90009
Gonçalves, Graça Marques; Gouveia, Luís; Pato, Margarida Vaz
2
2014
Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities. Zbl 1292.90165
Gollowitzer, Stefan; Gouveia, Luis; Ljubić, Ivana
6
2013
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route. Zbl 1269.90010
Gouveia, Luis; Riera-Ledesma, Jorge; Salazar-González, Juan-José
4
2013
Polynomial-time separation of enhanced reverse multistar inequalities. Zbl 1286.90017
Gouveia, Luis; Salazar-González, Juan-José
2
2013
Reload cost trees and network design. Zbl 1248.68379
Gamvros, Ioannis; Gouveia, Luis; Raghavan, S.
12
2012
On a time-dependent formulation and an updated classification of ATSP formulations. Zbl 1263.90074
Godinho, Maria Teresa; Gouveia, Luis; Pesneau, Pierre
7
2012
Enhancing discretized formulations: the knapsack reformulation and the star reformulation. Zbl 1261.68006
Gouveia, Luís; Moura, Pedro
4
2012
Models and heuristics for the \(k\)-degree constrained minimum spanning tree problem with node-degree costs. Zbl 1251.68169
Duhamel, Christophe; Gouveia, Luís; Moura, Pedro; De Souza, Maurício
4
2012
On the hop constrained Steiner tree problem with multiple root nodes. Zbl 1370.90216
Gouveia, Luis; Leitner, Markus; Ljubić, Ivana
1
2012
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. Zbl 1218.90201
Gouveia, Luis; Simonetti, Luidi; Uchoa, Eduardo
38
2011
The skill vehicle routing problem. Zbl 1345.90090
Cappanera, Paola; Gouveia, Luís; Scutellà, Maria Grazia
5
2011
Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem. Zbl 1205.90288
Gouveia, Luis; Paias, Ana; Sharma, Dushyant
5
2011
Models for a traveling purchaser problem with additional side-constraints. Zbl 1231.90089
Gouveia, Luis; Paias, Ana; Voß, Stefan
5
2011
Prize collecting Steiner trees with node degree dependent costs. Zbl 1231.90368
Gouveia, Luís; Moura, Pedro; de Sousa, Amaro
5
2011
Reformulation by intersection method on the MST problem with lower bound on the number of leaves. Zbl 1345.90093
Gouveia, Luís; Telhada, João
3
2011
A node splitting technique for two level network design problems with transition nodes. Zbl 1345.90091
Gollowitzer, Stefan; Gouveia, Luis; Ljubić, Ivana
2
2011
Lexicographical minimization of routing hops in telecommunication networks. Zbl 1345.90034
Gouveia, Luís; Patrício, Pedro; de Sousa, Amaro
1
2011
The two level network design problem with secondary hop constraints. Zbl 1345.90092
Gollowitzer, Stefan; Gouveia, Luís; Ljubić, Ivana
1
2011
Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models. Zbl 1219.90176
Gouveia, Luís; Patrício, Pedro; De Sousa, Amaro
1
2011
Lower bounds for the mixed capacitated arc routing problem. Zbl 1175.90039
Gouveia, Luís; Mourão, Maria Cândida; Pinto, Leonor Santiago
11
2010
Discretized formulations for capacitated location problems with modular distribution costs. Zbl 1178.90223
Correia, Isabel; Gouveia, Luís; Saldanha-da-Gama, Francisco
10
2010
Spanning trees with node degree cependent costs and knapsack reformulations. Zbl 1274.90310
Gouveia, Luís; Moura, Pedro
4
2010
Extended formulations for the cardinality constrained subtree of a tree problem. Zbl 1167.90659
Agra, A.; Gouveia, L.; Requejo, C.
1
2009
Solving the variable size bin packing problem with discretized formulations. Zbl 1139.90025
Correia, Isabel; Gouveia, Luís; Saldanha-da-Gama, Francisco
22
2008
Hop-constrained node survivable network design: An application to MPLS over WDM. Zbl 1172.90339
Gouveia, Luís; Patrício, Pedro; de Sousa, Amaro
14
2008
Modeling and solving the rooted distance-constrained minimum spanning tree problem. Zbl 1141.90031
Gouveia, Luis; Paias, Ana; Sharma, Dushyant
13
2008
Combined route capacity and route length models for unit demand vehicle routing problems. Zbl 1168.90359
Godinho, Maria Teresa; Gouveia, Luis; Magnanti, Thomas L.
10
2008
The multi-weighted Steiner tree problem: A reformulation by intersection. Zbl 1171.90533
Gouveia, Luis; Telhada, João
3
2008
Models and heuristics for a minimum arborescence problem. Zbl 1175.90059
Duhamel, Christophe; Gouveia, Luis; Moura, Pedro; Souza, Mauricio
3
2008
Reformulation by discretization: application to economic lot sizing. Zbl 1149.90106
Constantino, Miguel; Gouveia, Luis
4
2007
Network flow models for the local access network expansion problem. Zbl 1102.90010
Corte-Real, Margarida; Gouveia, Luís
3
2007
On formulations and methods for the hop-constrained minimum spanning tree problem. Zbl 1118.90051
Dahl, Geir; Gouveia, Luis; Requejo, Cristina
21
2006
On the capacitated concentrator location problem: a reformulation by discretization. Zbl 1126.90377
Gouveia, Luís; Saldanha-da-Gama, Francisco
19
2006
On extended formulations for the precedence constrained asymmetric traveling salesman problem. Zbl 1103.90084
Gouveia, L.; Pesneau, P.
16
2006
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. Zbl 1107.90007
Gouveia, Luis; Magnanti, Thomas L.; Requejo, Cristina
6
2006
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations. Zbl 1066.90102
Gouveia, Luis; Martins, Pedro
6
2005
The capacitated minimum spanning tree problem: On improved multistar constraints. Zbl 1067.90141
Gouveia, Luís; Lopes, Maria João
3
2005
On the directed hop-constrained shortest path problem. Zbl 1056.90116
Dahl, Geir; Gouveia, Luis
15
2004
A 2-path approach for odd-diameter-constrained minimum spanning and Steiner trees. Zbl 1058.90069
Gouveia, Luis; Magnanti, Thomas L.; Requejo, Cristina
10
2004
A note on hop-constrained walk polytopes. Zbl 1052.05033
Dahl, Geir; Foldnes, Njål; Gouveia, Luis
5
2004
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Zbl 1106.90014
Gouveia, Luis; Magnanti, Thomas L.
27
2003
Multistars and directed flow formulations. Zbl 1035.90097
Gouveia, Luis; Hall, Leslie
3
2002
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. Zbl 1055.90084
Gouveia, Luís; Requejo, Cristina
18
2001
The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints. Zbl 1054.90059
Gouveia, Luis; Pires, Jose Manuel
13
2001
An augmented arborescence formulation for the two-level network design problem. Zbl 1019.90004
Gouveia, Luis; Telhada, João
6
2001
Models for a Steiner ring network design problem with revenues. Zbl 1006.90014
Gouveia, Luis; Pires, Jose Manuel
4
2001
A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem. Zbl 0938.90067
Gouveia, Luis; Martins, Pedro
12
2000
Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs. Zbl 0959.90057
Gouveia, Luis; Lopes, Maria João
5
2000
The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints. Zbl 0971.90099
Gouveia, Luis; Pires, Jose Manuel
24
1999
The capacitated minimal spanning tree problem: An experiment with a hop-indexed model. Zbl 0921.90141
Gouveia, Luis; Martins, Pedro
11
1999
Using variable redefinfition for computing lower bounds for minimum spanning and Steiner trees with Hop constraints. Zbl 1054.90622
Gouveia, Luis
36
1998
Minimal spanning trees with a constraint on the number of leaves. Zbl 0957.90010
Fernandes, Lucinda Matos; Gouveia, Luis
17
1998
Designing reliable tree networks with two cable technologies. Zbl 0955.90009
Gouveia, Luis; Janssen, Eric
4
1998
Multicommodity flow models for spanning trees with hop constraints. Zbl 0947.90513
Gouveia, Luis
34
1996
Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with Hop constraints. Zbl 0854.90139
Gouveia, Luis
37
1995
A \(2n\) constraint formulation for the capacitated minimal spanning tree problem. Zbl 0830.90049
Gouveia, Luis
37
1995
A classification of formulations for the (time-dependent) traveling salesman problem. Zbl 0903.90170
Gouveia, Luis; Voß, Stefan
36
1995
A result on projection for the vehicle routing problem. Zbl 0912.90118
Gouveia, Luis
31
1995
Dynamic programming based heuristics for the topological design of local access networks. Zbl 0736.90032
Gouveia, L.; Paixão, J.
6
1991
all top 5

Cited by 688 Authors

64 Gouveia, Luis
15 Salazar-González, Juan-José
14 Laporte, Gilbert
11 Cordeau, Jean-François
10 Leitner, Markus
10 Ljubić, Ivana
10 Uchoa, Eduardo
8 Simonetti, Luidi G.
7 Fernández, Elena
7 Letchford, Adam N.
7 Ruthmair, Mario
7 Voß, Stefan
6 Ben-Ameur, Walid
6 Gendreau, Michel
6 Haouari, Mohamed
6 Lucena, Abilio
6 Mafuta, Phillip
6 Requejo, Cristina
6 Santos, Andréa Cynthia
5 Bektas, Tolga
5 de Sousa, Amaro
5 Leggieri, Valeria
5 Martins, Pedro
5 Moura, Pedro S.
5 Mukwembi, Simon
5 Salles da Cunha, Alexandre
4 Agra, Agostinho
4 Contreras, Iván A.
4 de Souza, Maurício Cardoso
4 Fontes, Dalila B. M. M.
4 Fortz, Bernard
4 Galbiati, Giulia
4 Gaudioso, Manlio
4 Gendron, Bernard
4 Mahjoub, Ali Ridha
4 Mateus, Geraldo Robson
4 Miranda-Bront, Juan José
4 Monnot, Jérôme
4 Paias, Ana
4 Pessoa, Artur Alves
4 Pires, Jose Manuel
4 Ribeiro, Celso Carneiro
4 Vidal, Thibaut
3 Akgün, İbrahim
3 Albareda-Sambola, Maria
3 Aloise, Dario José
3 Alvarez-Valdes, Ramon
3 Baldacci, Roberto
3 Chardy, Matthieu
3 Ciré, André Augusto
3 Costa, Alysson M.
3 Dahl, Geir
3 de Souza, Cid Carvalho
3 Di Puglia Pugliese, Luigi
3 Fukasawa, Ricardo
3 Godinho, Maria Teresa
3 Gözüpek, Didem
3 Guerriero, Francesca
3 Hernández-Pérez, Hipólito
3 Iori, Manuel
3 Kawatra, Rakesh
3 Lacroix, Mathieu
3 Laganà, Demetrio
3 Lopes, Maria João
3 Maffioli, Francesco
3 Mansini, Renata
3 Méndez-Díaz, Isabel
3 Mourão, Maria Cândida
3 Parreño, Francisco
3 Pesneau, Pierre
3 Puerto Albandoz, Justo
3 Riera-Ledesma, Jorge
3 Sadykov, Ruslan
3 Saldanha-da-Gama, Francisco
3 Sarin, Subhash C.
3 Shalom, Mordechai
3 Sharma, Dushyant
3 Sherali, Hanif D.
3 Stephan, Rüdiger
3 Subramanian, Anand Prabhu
3 Tamarit, José Manuel
3 Toth, Paolo
3 Triki, Chefi
3 Usberti, Fábio Luiz
3 Vigo, Daniele
2 Agarwal, Yogesh Kumar
2 Aksen, Deniz
2 Almeida, Maria Teresa
2 Angilella, Vincent
2 Aras, Necati
2 Balakrishnan, Anantaram
2 Baldi, Mauro Maria
2 Barbato, Michele
2 Bergantiños, Gustavo
2 Blum, Christian
2 Boginski, Vladimir L.
2 Bricker, Dennis L.
2 Butenko, Sergiy I.
2 Campbell, Ann Melissa
2 Carvalho, Filipa D.
...and 588 more Authors
all top 5

Cited in 49 Serials

114 European Journal of Operational Research
68 Computers & Operations Research
23 Discrete Applied Mathematics
19 Networks
14 Operations Research Letters
13 Annals of Operations Research
11 Optimization Letters
10 INFORMS Journal on Computing
10 Discrete Optimization
9 Mathematical Programming. Series A. Series B
8 International Transactions in Operational Research
6 Journal of Global Optimization
6 Top
6 OR Spectrum
6 EURO Journal on Computational Optimization
5 Computational Optimization and Applications
5 Journal of Combinatorial Optimization
4 Journal of Heuristics
3 Theoretical Computer Science
3 Applied Mathematical Modelling
3 RAIRO. Operations Research
3 Networks and Spatial Economics
2 Information Processing Letters
2 Naval Research Logistics
2 Operations Research
2 Optimization and Engineering
2 Mathematical Programming Computation
2 Afrika Matematika
1 Czechoslovak Mathematical Journal
1 Information Sciences
1 Opsearch
1 Quaestiones Mathematicae
1 Combinatorica
1 Acta Mathematica Hungarica
1 Graphs and Combinatorics
1 Algorithmica
1 Discrete & Computational Geometry
1 YUJOR. Yugoslav Journal of Operations Research
1 Automation and Remote Control
1 SIAM Journal on Optimization
1 Journal of Computer and Systems Sciences International
1 Journal of Mathematical Sciences (New York)
1 Optimization Methods & Software
1 CEJOR. Central European Journal of Operations Research
1 4OR
1 Computational Management Science
1 Frontiers of Mathematics in China
1 Logical Methods in Computer Science
1 Algorithms

Citations by Year