default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuis Eduardo Neves Gouveia
Luís Gouveia 0001 – Luis Gouveia 0001
Person information
- affiliation: University of Lisbon, Portugal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j104]Michele Barbato
, Luís Gouveia:
The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms. Eur. J. Oper. Res. 316(2): 473-487 (2024)- 2023
- [j103]Luís Gouveia, Ana Paias, Mafalda Ponte:
The travelling salesman problem with positional consistency constraints: An application to healthcare services. Eur. J. Oper. Res. 308(3): 960-989 (2023) - [j102]Michele Barbato, Francisco Canas, Luís Gouveia, Pierre Pesneau:
Node based compact formulations for the Hamiltonian p-median problem. Networks 82(4): 336-370 (2023) - [j101]Luís Gouveia, Markus Leitner, Mario Ruthmair:
Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm. Transp. Sci. 57(2): 512-530 (2023) - 2022
- [j100]Bernard Fortz, Luis Gouveia, Pedro Moura:
A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints. Networks 80(2): 178-192 (2022) - [j99]Raquel Bernardino, Luís Gouveia, Ana Paias, Daniel Santos:
The multi-depot family traveling salesman problem and clustered variants: Mathematical formulations and branch-&-cut based methods. Networks 80(4): 502-571 (2022) - 2021
- [j98]Luis Gouveia, Seán McGarraghy, Cathal MacSwiney Brugha:
Introduction to Special Issue. Eur. J. Oper. Res. 291(3): 807 (2021) - [j97]Bernard Fortz, Luis Gouveia, Christina Büsing, Markus Leitner:
Preface: Special issue on network analytics and optimization. Networks 77(4): 475-476 (2021) - 2020
- [j96]Tolga Bektas, Luís Gouveia, Daniel Santos:
Compact formulations for multi-depot routing problems: Theoretical and computational comparisons. Comput. Oper. Res. 124: 105084 (2020) - [j95]Luis Gouveia, Markus Leitner, Ivana Ljubic:
A polyhedral study of the diameter constrained minimum spanning tree problem. Discret. Appl. Math. 285: 364-379 (2020) - [j94]Luis Gouveia, Markus Leitner, Mario Ruthmair, Ruslan Sadykov:
Corrigendum to "Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem" [European Journal of Operational Research, 262(3) 2017, 908-928]. Eur. J. Oper. Res. 285(3): 1199-1203 (2020)
2010 – 2019
- 2019
- [j93]Luis Gouveia, Markus Leitner, Mario Ruthmair:
Layered graph approaches for combinatorial optimization problems. Comput. Oper. Res. 102: 22-38 (2019) - [j92]Tolga Bektas, Luis Gouveia, Antonio Martinez-Sykora, Juan José Salazar González:
Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm. Eur. J. Oper. Res. 273(2): 452-463 (2019) - [j91]Tolga Bektas, Luís Gouveia, Daniel Santos:
Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm. Eur. J. Oper. Res. 276(1): 40-64 (2019) - 2018
- [j90]Quentin Botton, Bernard Fortz, Luis Gouveia:
The 2 edge-disjoint 3-paths polyhedron. Ann. des Télécommunications 73(1-2): 29-36 (2018) - [j89]Luís Gouveia, Martim Joyce-Moniz, Markus Leitner:
Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints. Comput. Oper. Res. 91: 190-208 (2018) - [j88]Bernard Fortz, Luís Gouveia, Martim Joyce-Moniz:
Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol. Discret. Appl. Math. 234: 114-130 (2018) - [j87]Luís Gouveia, Pedro Moura:
Preface. Electron. Notes Discret. Math. 64: 1-3 (2018) - [j86]Luis Gouveia, Pierre Pesneau, Mario Ruthmair, Daniel Santos:
Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem. Networks 71(4): 451-465 (2018) - [j85]Luis Gouveia, Pedro Moura:
New advances and applications in deterministic and stochastic network optimization. Networks 72(1): 3-4 (2018) - 2017
- [j84]Luis Gouveia, Luidi Simonetti:
Spanning trees with a constraint on the number of leaves. A new formulation. Comput. Oper. Res. 81: 257-268 (2017) - [j83]Luis Gouveia, Markus Leitner:
Design of survivable networks with vulnerability constraints. Eur. J. Oper. Res. 258(1): 89-103 (2017) - [j82]Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Joyce-Moniz:
Models for the piecewise linear unsplittable multicommodity flow problems. Eur. J. Oper. Res. 261(1): 30-42 (2017) - [j81]Luis Eduardo Neves Gouveia, Markus Leitner, Mario Ruthmair:
Extended formulations and branch-and-cut algorithms for the Black-and-White Traveling Salesman Problem. Eur. J. Oper. Res. 262(3): 908-928 (2017) - [j80]Luis Eduardo Neves Gouveia, Michal Pióro, Jacek Rak:
Preface: Static and dynamic optimization models for network routing problems. Networks 69(1): 3-5 (2017) - [j79]Tolga Bektas, Luis Eduardo Neves Gouveia, Daniel Santos:
New path elimination constraints for multi-depot routing problems. Networks 70(3): 246-261 (2017) - [j78]Bernard Gendron, Luis Eduardo Neves Gouveia:
Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems. Transp. Sci. 51(2): 629-649 (2017) - 2016
- [j77]Luis Eduardo Neves Gouveia, Andrea Lodi, Ali Ridha Mahjoub:
Preface. Discret. Optim. 22: 1-5 (2016) - [j76]Bernard Fortz, Luis Eduardo Neves Gouveia:
Editorial. EURO J. Comput. Optim. 4(2): 123-124 (2016) - [j75]I. Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luis Eduardo Neves Gouveia, Pierre Pesneau:
Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. Networks 67(2): 148-169 (2016) - [j74]Luis Eduardo Neves Gouveia, Pedro Patrício, Amaro de Sousa:
Lexicographical minimization of routing hops in hop-constrained node survivable networks. Telecommun. Syst. 62(2): 417-434 (2016) - [c11]Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Joyce-Moniz:
On the convex piecewise linear unsplittable multicommodity flow problem. DRCN 2016: 9-13 - [c10]Amaro de Sousa, Luis Eduardo Neves Gouveia, Pedro Patrício:
Maximization of protected demand in telecommunication networks using partial disjoint paths. RNDM 2016: 72-78 - 2015
- [j73]Luis Eduardo Neves Gouveia, Mario Ruthmair:
Load-dependent and precedence-based models for pickup and delivery problems. Comput. Oper. Res. 63: 56-71 (2015) - [j72]Quentin Botton, Bernard Fortz, Luis Eduardo Neves Gouveia:
On the hop-constrained survivable network design problem with reliable edges. Comput. Oper. Res. 64: 159-167 (2015) - [j71]Luis Eduardo Neves Gouveia, Pedro Martins:
Solving the maximum edge-weight clique problem in sparse graphs with compact formulations. EURO J. Comput. Optim. 3(1): 1-30 (2015) - [j70]Luis Eduardo Neves Gouveia, Maria João Lopes, Amaro de Sousa:
Single PON network design with unconstrained splitting stages. Eur. J. Oper. Res. 240(2): 361-371 (2015) - [j69]Miguel Fragoso Constantino, Luis Eduardo Neves Gouveia, Maria Cândida Mourão, Ana Catarina Nunes:
The mixed capacitated arc routing problem with non-overlapping routes. Eur. J. Oper. Res. 244(2): 445-456 (2015) - [j68]Daniele Catanzaro, Luis Eduardo Neves Gouveia, Martine Labbé:
Improved integer linear programming formulations for the job Sequencing and tool Switching Problem. Eur. J. Oper. Res. 244(3): 766-777 (2015) - [j67]Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic:
The two-level diameter constrained spanning tree problem. Math. Program. 150(1): 49-78 (2015) - 2014
- [j66]Graça Marques Gonçalves, Luis Eduardo Neves Gouveia, Margarida Vaz Pato:
An improved decomposition-based heuristic to design a water distribution network for an irrigation system. Ann. Oper. Res. 219(1): 141-167 (2014) - [j65]Maria Teresa Godinho, Luis Eduardo Neves Gouveia, Pierre Pesneau:
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem. Discret. Appl. Math. 164: 138-153 (2014) - [j64]Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic:
Hop constrained Steiner trees with multiple root nodes. Eur. J. Oper. Res. 236(1): 100-112 (2014) - [j63]Tolga Bektas, Luis Eduardo Neves Gouveia:
Requiem for the Miller-Tucker-Zemlin subtour elimination constraints? Eur. J. Oper. Res. 236(3): 820-832 (2014) - [j62]Luis Eduardo Neves Gouveia, Pedro Moura, Mario Ruthmair, Amaro de Sousa:
Spanning trees with variable degree bounds. Eur. J. Oper. Res. 239(3): 830-841 (2014) - [j61]Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Gilbert Laporte, Dilson Lucas Pereira, Adam Wojciechowski:
A comparison of several models for the hamiltonian p-median problem. Networks 63(4): 350-363 (2014) - [c9]Bernard Fortz, Luis Eduardo Neves Gouveia, Martim Moniz:
Mathematical Programming Models for Traffic Engineering in Ethernet Networks Implementing the Multiple Spanning Tree Protocol. ISCO 2014: 242-254 - [e1]Pierre Fouilhoux, Luis Eduardo Neves Gouveia, Ali Ridha Mahjoub, Vangelis Th. Paschos:
Combinatorial Optimization - Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8596, Springer 2014, ISBN 978-3-319-09173-0 [contents] - 2013
- [j60]Bernard Fortz, Luis Eduardo Neves Gouveia:
SI on computational methods for network optimization problems. EURO J. Comput. Optim. 1(3-4): 219 (2013) - [j59]Paola Cappanera, Luis Eduardo Neves Gouveia, Maria Grazia Scutellà:
Models and valid inequalities to asymmetric skill-based routing problems. EURO J. Transp. Logist. 2(1-2): 29-55 (2013) - [j58]Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic:
Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities. Eur. J. Oper. Res. 225(2): 211-222 (2013) - [j57]Quentin Botton, Bernard Fortz, Luis Eduardo Neves Gouveia, Michael Poss:
Benders Decomposition for the Hop-Constrained Survivable Network Design Problem. INFORMS J. Comput. 25(1): 13-26 (2013) - [j56]Luis Eduardo Neves Gouveia, Stefan Voß:
Editorial. Networks 61(2): 87-88 (2013) - [j55]Luis Eduardo Neves Gouveia, Jorge Riera-Ledesma, Juan José Salazar González:
Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route. Networks 61(4): 309-321 (2013) - [j54]Luis Eduardo Neves Gouveia, Juan José Salazar González:
Polynomial-time separation of Enhanced Reverse Multistar inequalities. Oper. Res. Lett. 41(3): 294-297 (2013) - 2012
- [j53]Luis Eduardo Neves Gouveia, Maria Grazia Scutellà:
Editorial. Networks 59(1): 1-2 (2012) - [j52]Ioannis Gamvros, Luis Eduardo Neves Gouveia, S. Raghavan:
Reload cost trees and network design. Networks 59(4): 365-379 (2012) - [j51]Christophe Duhamel, Luis Eduardo Neves Gouveia, Pedro Moura, Maurício C. de Souza:
Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs. Networks 60(1): 1-18 (2012) - [c8]Luis Eduardo Neves Gouveia, Markus Leitner, Ivana Ljubic:
On the Hop Constrained Steiner Tree Problem with Multiple Root Nodes. ISCO 2012: 201-212 - 2011
- [j50]Luis Eduardo Neves Gouveia, Pedro Moura, Amaro de Sousa:
Prize collecting Steiner trees with node degree dependent costs. Comput. Oper. Res. 38(1): 234-245 (2011) - [j49]Luis Eduardo Neves Gouveia, Ana Paias, Stefan Voß:
Models for a traveling purchaser problem with additional side-constraints. Comput. Oper. Res. 38(2): 550-558 (2011) - [j48]Luis Eduardo Neves 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) - [j47]Luis Eduardo Neves Gouveia, Pedro Patrício, Amaro de Sousa:
Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models. Int. Trans. Oper. Res. 18(3): 335-358 (2011) - [j46]Luis Eduardo Neves 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) - [c7]Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic:
A Node Splitting Technique for Two Level Network Design Problems with Transition Nodes. INOC 2011: 57-70 - [c6]Stefan Gollowitzer, Luis Eduardo Neves Gouveia, Ivana Ljubic:
The Two Level Network Design Problem with Secondary Hop Constraints. INOC 2011: 71-76 - [c5]Luis Eduardo Neves Gouveia, Pedro Moura, Amaro de Sousa:
Spanning Trees with Generalized Degree Constraints Arising in the Design of Wireless Networks. INOC 2011: 77-82 - [c4]Luis Eduardo Neves Gouveia, João Telhada:
Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves. INOC 2011: 83-91 - [c3]Luis Eduardo Neves Gouveia, Pedro Patrício, Amaro de Sousa:
Lexicographical Minimization of Routing Hops in Telecommunication Networks. INOC 2011: 216-229 - [c2]Paola Cappanera, Luis Eduardo Neves Gouveia, Maria Grazia Scutellà:
The Skill Vehicle Routing Problem. INOC 2011: 354-364 - 2010
- [j45]Luis Eduardo Neves Gouveia, Maria Cândida Mourão, Leonor Santiago Pinto:
Lower bounds for the mixed capacitated arc routing problem. Comput. Oper. Res. 37(4): 692-699 (2010) - [j44]Luis Eduardo Neves Gouveia, Pedro Moura:
Spanning Trees with Node Degree Dependent Costs and Knapsack Reformulations. Electron. Notes Discret. Math. 36: 985-992 (2010) - [j43]Luis Eduardo Neves Gouveia, Juan José Salazar González:
On the Vehicle Routing Problem with lower bound capacities. Electron. Notes Discret. Math. 36: 1001-1008 (2010) - [j42]Maria Teresa Godinho, Luis Eduardo Neves Gouveia, Pierre Pesneau:
Hop-indexed Circuit-based formulations for the Traveling Salesman Problem. Electron. Notes Discret. Math. 36: 1049-1056 (2010) - [j41]Margarida Corte-Real, Luis Eduardo Neves Gouveia:
A node rooted flow-based model for the local access network expansion problem. Eur. J. Oper. Res. 204(1): 20-34 (2010) - [j40]Isabel Correia, Luis Eduardo Neves Gouveia, Francisco Saldanha-da-Gama:
Discretized formulations for capacitated location problems with modular distribution costs. Eur. J. Oper. Res. 204(2): 237-244 (2010) - [j39]Bernard Fortz, Luis Eduardo Neves Gouveia:
Editorial. Networks 55(3): 169-170 (2010)
2000 – 2009
- 2009
- [j38]Luis Eduardo Neves Gouveia:
Preface. Networks 53(2): 89-90 (2009) - [j37]Agostinho Agra, Luis Eduardo Neves Gouveia, Cristina Requejo:
Extended formulations for the cardinality constrained subtree of a tree problem. Oper. Res. Lett. 37(3): 192-196 (2009) - 2008
- [j36]Luis Eduardo Neves Gouveia, Ana Paias, Dushyant Sharma:
Modeling and solving the rooted distance-constrained minimum spanning tree problem. Comput. Oper. Res. 35(2): 600-613 (2008) - [j35]Isabel Correia, Luis Eduardo Neves Gouveia, Francisco Saldanha-da-Gama:
Solving the variable size bin packing problem with discretized formulations. Comput. Oper. Res. 35(6): 2103-2113 (2008) - [j34]Luis Eduardo Neves Gouveia, João Telhada:
The multi-weighted Steiner tree problem: A reformulation by intersection. Comput. Oper. Res. 35(11): 3599-3611 (2008) - [j33]Maria Teresa Godinho, Luis Eduardo Neves Gouveia, Thomas L. Magnanti:
Combined route capacity and route length models for unit demand vehicle routing problems. Discret. Optim. 5(2): 350-372 (2008) - [j32]Christophe Duhamel, Luis Eduardo Neves Gouveia, Pedro Moura, Maurício C. de Souza:
Models and heuristics for a minimum arborescence problem. Networks 51(1): 34-47 (2008) - 2007
- [j31]Margarida Corte-Real, Luis Eduardo Neves Gouveia:
Network flow models for the local access network expansion problem. Comput. Oper. Res. 34(4): 1141-1157 (2007) - [j30]Luis Eduardo Neves Gouveia, Stefan Voß:
Preface. Networks 49(1): 1-2 (2007) - [j29]Walid Ben-Ameur, Luis Eduardo Neves Gouveia:
Preface. Networks 50(1): 1-2 (2007) - [j28]Miguel Fragoso Constantino, Luis Eduardo Neves Gouveia:
Reformulation by discretization: Application to economic lot sizing. Oper. Res. Lett. 35(5): 645-650 (2007) - 2006
- [j27]Luis Eduardo Neves Gouveia, Thomas L. Magnanti, Cristina Requejo:
An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees. Ann. Oper. Res. 146(1): 19-39 (2006) - [j26]Luis Eduardo Neves Gouveia, Francisco Saldanha-da-Gama:
On the capacitated concentrator location problem: a reformulation by discretization. Comput. Oper. Res. 33: 1242-1258 (2006) - [j25]Walid Ben-Ameur, Luis Eduardo Neves Gouveia:
Further contributions to network optimization. Networks 48(1): 1-6 (2006) - [j24]Luis Eduardo Neves Gouveia, Pierre Pesneau:
On extended formulations for the precedence constrained asymmetric traveling salesman problem. Networks 48(2): 77-89 (2006) - [p1]Geir Dahl, Luis Eduardo Neves Gouveia, Cristina Requejo:
On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem. Handbook of Optimization in Telecommunications 2006: 493-515 - 2005
- [j23]Luis Eduardo Neves Gouveia, Pedro Martins:
The capacitated minimum spanning tree problem: revisiting hop-indexed formulations. Comput. Oper. Res. 32: 2435-2452 (2005) - [j22]Luis Eduardo Neves Gouveia, Maria João Lopes:
The capacitated minimum spanning tree problem: On improved multistar constraints. Eur. J. Oper. Res. 160(1): 47-62 (2005) - 2004
- [j21]Walid Ben-Ameur, Luis Eduardo Neves Gouveia:
Some recent contributions to network optimization. Networks 44(1): 27-30 (2004) - [j20]Luis Eduardo Neves 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) - [j19]Geir Dahl, Luis Eduardo Neves Gouveia:
On the directed hop-constrained shortest path problem. Oper. Res. Lett. 32(1): 15-22 (2004) - [j18]Geir Dahl, Njål Foldnes, Luis Eduardo Neves Gouveia:
A note on hop-constrained walk polytopes. Oper. Res. Lett. 32(4): 345-349 (2004) - 2003
- [j17]Luis Eduardo Neves Gouveia, Thomas L. Magnanti:
Network flow models for designing diameter-constrained minimum-spanning and Steiner trees. Networks 41(3): 159-173 (2003) - [c1]Luis Eduardo Neves 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: 576-586 - 2002
- [j16]Luis Eduardo Neves Gouveia, Leslie A. Hall:
Multistars and directed flow formulations. Networks 40(4): 188-201 (2002) - 2001
- [j15]Luis Eduardo Neves Gouveia, João Telhada:
An Augmented Arborescence Formulation for the Two-Level Network Design Problem. Ann. Oper. Res. 106(1-4): 47-61 (2001) - [j14]Luis Eduardo Neves Gouveia, Jose Manuel Pires:
The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints. Discret. Appl. Math. 112(1-3): 129-145 (2001) - [j13]Luis Eduardo Neves Gouveia, Cristina Requejo:
A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem. Eur. J. Oper. Res. 132(3): 539-552 (2001) - [j12]Luis Eduardo Neves Gouveia, Jose Manuel Pires:
Models for a Steiner ring network design problem with revenues. Eur. J. Oper. Res. 133(1): 21-31 (2001) - 2000
- [j11]Luis Eduardo Neves Gouveia, Maria João Lopes:
Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs. Eur. J. Oper. Res. 121(2): 394-411 (2000) - [j10]Luis Eduardo Neves Gouveia, Pedro Martins:
A hierarchy of hop-indexed models for the Capacitated Minimum Spanning Tree Problem. Networks 35(1): 1-16 (2000)
1990 – 1999
- 1999
- [j9]Luis Eduardo Neves Gouveia, Pedro Martins:
The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexedmodel. Ann. Oper. Res. 86: 271-294 (1999) - [j8]Luis Eduardo Neves Gouveia, Jose Manuel Pires:
The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints. Eur. J. Oper. Res. 112(1): 134-146 (1999) - 1998
- [j7]Luis Eduardo Neves Gouveia, Eric Janssen:
Designing reliable tree networks with two cable technologies. Eur. J. Oper. Res. 105(3): 552-568 (1998) - [j6]Luis Eduardo Neves Gouveia:
Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints. INFORMS J. Comput. 10(2): 180-188 (1998) - 1997
- [j5]Luis Eduardo Neves Gouveia, Maria João Lopes:
Using generalized capacitated trees for designing the topology of local access networks. Telecommun. Syst. 7(4): 315-337 (1997) - 1995
- [j4]Luis Eduardo Neves Gouveia:
Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints. Comput. Oper. Res. 22(9): 959-970 (1995) - [j3]Luis Eduardo Neves Gouveia:
A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem. Oper. Res. 43(1): 130-141 (1995) - 1993
- [j2]Luis Eduardo Neves Gouveia:
A comparison of directed formulations for the capacitated minimal spanning tree problem. Telecommun. Syst. 1(1): 51-76 (1993) - 1991
- [j1]Luis Eduardo Neves Gouveia, José Pinto Paixão:
Dynamic programming based heuristics for the topological design of local access networks. Ann. Oper. Res. 33(4): 305-327 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 01:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
