???global.info.a_carregar???
Identificação

Identificação pessoal

Nome completo
Luis Gouveia

Nomes de citação

  • Gouveia, Luis

Identificadores de autor

Ciência ID
2519-2D8F-E807
ORCID iD
0000-0003-4393-1617
Scopus Author Id
7004135845
Formação
Grau Classificação
2000/09 - 2000/09
Concluído
 Estatística e Investigação Operacional (Título de Agregado)
Universidade de Lisboa Faculdade de Ciências, Portugal
1989/01 - 1991/05
Concluído
 Doutoramento em Estatística e Computação, (Doutoramento)
Especialização em Investigação Operacional
Universidade de Lisboa Faculdade de Ciências, Portugal
Percurso profissional

Docência no Ensino Superior

Categoria Profissional
Instituição de acolhimento 		Empregador
2011 - Atual Professor Catedrático (Docente Universitário) Universidade de Lisboa Faculdade de Ciências, Portugal
Universidade de Lisboa Faculdade de Ciências, Portugal
Projetos

Projeto

Designação Financiadores
2020/01/01 - 2023/12/31 Centro de Matemática, Aplicações Fundamentais e Investigação Operacional
UIDB/04561/2020
Investigador responsável
FCiênciasID Associação para a Investigação e Desenvolvimento de Ciências, Portugal
 Fundação para a Ciência e a Tecnologia
Em curso
2020/01/01 - 2023/12/31 Centro de Matemática, Aplicações Fundamentais e Investigação Operacional
UIDP/04561/2020
Investigador responsável
FCiênciasID Associação para a Investigação e Desenvolvimento de Ciências, Portugal
 Fundação para a Ciência e a Tecnologia
Em curso
2019/01/01 - 2019/12/31 Centro de Matemática, Aplicações Fundamentais e Investigação Operacional
UID/MAT/04561/2019
Investigador responsável
FCiênciasID Associação para a Investigação e Desenvolvimento de Ciências, Portugal
 Fundação para a Ciência e a Tecnologia
Concluído
2016/05/01 - 2019/10/31 Modelação de Problemas de Roteamento e Escalonamento
PTDC/MAT-NAN/2196/2014
Investigador responsável
FCiênciasID Associação para a Investigação e Desenvolvimento de Ciências, Portugal

Universidade de Lisboa Centro de Matemática Aplicações Fundamentais e Investigação Operacional, Portugal

Universidade de Lisboa Instituto Superior de Agronomia, Portugal

ISEG Lisbon School of Economics and Management, Portugal

ISCTE-Instituto Universitário de Lisboa, Portugal
Fundação para a Ciência e a Tecnologia
Concluído
2015/01/01 - 2018/12/31 Centro de Matemática, Aplicações Fundamentais e Investigação Operacional
UID/MAT/04561/2013
Investigador
FCiênciasID Associação para a Investigação e Desenvolvimento de Ciências, Portugal
 Fundação para a Ciência e a Tecnologia
Concluído
2014/01/01 - 2015/12/31 Incentivo - UI 152 - 2014
Incentivo/MAT/UI0152/2014
Investigador responsável
Fundação da Faculdade de Ciências da Universidade de Lisboa, Portugal
 Fundação para a Ciência e a Tecnologia
Concluído
2012/01/02 - 2015/07/01 SEROW - Sectorização e Optimização de Rotas na Gestão de Resíduos - a teoria na prática
PTDC/EGE-GES/121406/2010
Investigador
Universidade de Lisboa Centro de Matemática Aplicações Fundamentais e Investigação Operacional, Portugal

Fundação da Faculdade de Ciências da Universidade de Lisboa, Portugal

Instituto de Engenharia de Sistemas e Computadores, Portugal

ISEG Lisbon School of Economics and Management, Portugal

ISCTE-Instituto Universitário de Lisboa, Portugal
Fundação para a Ciência e a Tecnologia
Concluído
2013/01/01 - 2015/03/31 Projecto Estratégico - UI 152 - 2013-2014
PEst-OE/MAT/UI0152/2013
Investigador responsável
Fundação da Faculdade de Ciências da Universidade de Lisboa, Portugal
 Fundação para a Ciência e a Tecnologia
Concluído
2011/01/01 - 2012/12/31 Projecto Estratégico - UI 152 - 2011-2012
PEst-OE/MAT/UI0152/2011
Investigador responsável
Fundação da Faculdade de Ciências da Universidade de Lisboa, Portugal
 Fundação para a Ciência e a Tecnologia
Concluído
2008/01/01 - 2009/06/30 TelNet - Redes de Telecomunicações Robustas: Métodos de Optimização para o Desenho Topológico, Dimensionamento e Engenharia de Tráfego
PTDC/EIA/64772/2006
Investigador responsável
Universidade de Lisboa Centro de Matemática Aplicações Fundamentais e Investigação Operacional, Portugal

Fundação da Faculdade de Ciências da Universidade de Lisboa, Portugal

Instituto de Telecomunicações Lisboa, Portugal
Fundação para a Ciência e a Tecnologia
Concluído
Produções

Publicações

Artigo em conferência
  1. Fortz, B.; Gouveia, L.; Joyce-Moniz, M.. "On the convex piecewise linear unsplittable multicommodity flow problem". 2016.
    10.1109/DRCN.2016.7470829
  2. De Sousa, A.; Gouveia, L.; Patricio, P.. "Maximization of protected demand in telecommunication networks using partial disjoint paths". 2016.
    10.1109/RNDM.2016.7608270
  3. Lopes, C.; De Sousa, A.; Gouveia, L.. "Combined link dimensioning and weight assignment of minimum weight routing networks". 2005.
    10.1109/NGI.2005.1431664
Artigo em revista
  1. Michele Barbato; Luís Gouveia. "The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms". European Journal of Operational Research (2024): https://doi.org/10.1016/j.ejor.2024.02.032.
    10.1016/j.ejor.2024.02.032
  2. Michele Barbato; Francisco Canas; Luís Gouveia; Pierre Pesneau. "Node based compact formulations for the Hamiltonian p-median problem". Networks (2023): http://dx.doi.org/10.1002/net.22163.
    10.1002/net.22163
  3. Luís Gouveia; Ana Paias; Mafalda Ponte. "The travelling salesman problem with positional consistency constraints: An application to healthcare services". European Journal of Operational Research (2023): http://dx.doi.org/10.1016/j.ejor.2022.11.050.
    10.1016/j.ejor.2022.11.050
  4. 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 (2022): https://doi.org/10.1002/net.22125.
    10.1002/net.22125
  5. Luis Gouveia; Markus Leitner; Mario Ruthmair. "Multi-Depot Routing with Split Deliveries: Models and a Branch-and-Cut Algorithm". Transportation Science (2022): https://doi.org/10.1287/trsc.2022.1179.
    10.1287/trsc.2022.1179
  6. 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 (2022): https://doi.org/10.1002/net.22086.
    10.1002/net.22086
  7. Bernard Fortz; Luis Gouveia; Christina Büsing; Markus Leitner. "Preface: Special issue on network analytics and optimization". Networks (2021): https://doi.org/10.1002/net.22039.
    10.1002/net.22039
  8. Bektas, Tolga; Gouveia, Luis; Santos, Daniel; Santos, Daniel. "Compact formulations for multi-depot routing problems: Theoretical and computational comparisons". Computers & Operations Research (2020): https://publons.com/publon/34039848/.
    10.1016/J.COR.2020.105084
  9. 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". European Journal of Operational Research (2019): https://doi.org/10.1016/j.ejor.2018.12.041.
    10.1016/j.ejor.2018.12.041
  10. Tolga Bektas; Luis Gouveia; Antonio Martínez-Sykora; Juan-José Salazar-González. "Balanced vehicle routing: Polyhedral analysis and branch-and-cut algorithm". European Journal of Operational Research (2019): https://doi.org/10.1016/j.ejor.2018.08.034.
    10.1016/j.ejor.2018.08.034
  11. Luis Gouveia; Markus Leitner; Mario Ruthmair. "Layered graph approaches for combinatorial optimization problems". Computers & Operations Research 102 (2019): 22-38. https://doi.org/10.1016/j.cor.2018.09.007.
    10.1016/j.cor.2018.09.007
  12. Luis Gouveia; Pedro Moura. "New advances and applications in deterministic and stochastic network optimization". Networks (2018): https://doi.org/10.1002/net.21823.
    10.1002/net.21823
  13. Gouveia, Luis; Pesneau, Pierre; Ruthmair, Mario; Santos, Daniel; Santos, Daniel. "Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem". Networks 71 4 (2018): 451-465. https://publons.com/publon/19186562/.
    Publicado • 10.1002/NET.21765
  14. Luis Gouveia; Luidi Simonetti. "Spanning trees with a constraint on the number of leaves. A new formulation". Computers & Operations Research 81 (2017): 257-268. https://doi.org/10.1016%2Fj.cor.2016.12.005.
    10.1016/j.cor.2016.12.005
  15. Fortz, B.; Gouveia, L.; Joyce-Moniz, M.. "Models for the piecewise linear unsplittable multicommodity flow problems". European Journal of Operational Research 261 1 (2017): 30-42. http://www.scopus.com/inward/record.url?eid=2-s2.0-85012875315&partnerID=MN8TOARS.
    10.1016/j.ejor.2017.01.051
  16. Gouveia, L.; Leitner, M.. "Design of survivable networks with vulnerability constraints". European Journal of Operational Research 258 1 (2017): 89-103. http://www.scopus.com/inward/record.url?eid=2-s2.0-84992724156&partnerID=MN8TOARS.
    10.1016/j.ejor.2016.09.003
  17. Gouveia, L.; Joyce-Moniz, M.; Leitner, M.. "Branch-and-cut methods for the Network Design Problem with Vulnerability Constraints". Computers and Operations Research (2017): http://www.scopus.com/inward/record.url?eid=2-s2.0-85033434283&partnerID=MN8TOARS.
    10.1016/j.cor.2017.10.005
  18. Gouveia, L.; Leitner, M.; Ruthmair, M.. "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. http://www.scopus.com/inward/record.url?eid=2-s2.0-85019855650&partnerID=MN8TOARS.
    10.1016/j.ejor.2017.04.061
  19. Bektas, T.; Gouveia, L.; Santos, D.. "New path elimination constraints for multi-depot routing problems". Networks 70 3 (2017): 246-261. http://www.scopus.com/inward/record.url?eid=2-s2.0-85028733415&partnerID=MN8TOARS.
    10.1002/net.21760
  20. Gouveia, L.; Pióro, M.; Rak, J.. "Preface: Static and dynamic optimization models for network routing problems". Networks 69 1 (2017): 3-5. http://www.scopus.com/inward/record.url?eid=2-s2.0-85005900859&partnerID=MN8TOARS.
    10.1002/net.21725
  21. Gendron, B.; Gouveia, L.. "Reformulations by discretization for piecewise linear integer multicommodity network flow problems". Transportation Science 51 2 (2017): 629-649. http://www.scopus.com/inward/record.url?eid=2-s2.0-85016475195&partnerID=MN8TOARS.
    10.1287/trsc.2015.0634
  22. Gouveia, L.; Patrício, P.; de Sousa, A.. "Lexicographical minimization of routing hops in hop-constrained node survivable networks". Telecommunication Systems 62 2 (2016): 417-434. http://www.scopus.com/inward/record.url?eid=2-s2.0-84941347125&partnerID=MN8TOARS.
    10.1007/s11235-015-0083-9
  23. Bautzer, A.; Gouveia, L.; Paias, A.; Pires, J.M.. "Models for a Steiner multi-ring network design problem with revenues". TOP 24 2 (2016): 360-380. http://www.scopus.com/inward/record.url?eid=2-s2.0-84976286238&partnerID=MN8TOARS.
    10.1007/s11750-015-0388-6
  24. Fortz, B.; Gouveia, L.. "Editorial". EURO Journal on Computational Optimization 4 2 (2016): 123-124. http://www.scopus.com/inward/record.url?eid=2-s2.0-85027975227&partnerID=MN8TOARS.
    10.1007/s13675-016-0068-9
  25. Diarrassouba, I.; Gabrel, V.; Mahjoub, A.R.; Gouveia, L.; Pesneau, P.. "Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem". Networks 67 2 (2016): 148-169. http://www.scopus.com/inward/record.url?eid=2-s2.0-84958864521&partnerID=MN8TOARS.
    10.1002/net.21667
  26. Fortz, B.; Gouveia, L.; Joyce-Moniz, M.. "Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol". Discrete Applied Mathematics (2015): http://www.scopus.com/inward/record.url?eid=2-s2.0-85003827407&partnerID=MN8TOARS.
    10.1016/j.dam.2016.07.015
  27. Gouveia, L.; Salazar-González, J.-J.. "Preface". Networks 65 4 (2015): 287-288. http://www.scopus.com/inward/record.url?eid=2-s2.0-84930514221&partnerID=MN8TOARS.
    10.1002/net.21613
  28. Catanzaro, D.; Gouveia, L.; Labbé, M.. "Improved integer linear programming formulations for the job Sequencing and tool Switching Problem". European Journal of Operational Research 244 3 (2015): 766-777. http://www.scopus.com/inward/record.url?eid=2-s2.0-84926419995&partnerID=MN8TOARS.
    10.1016/j.ejor.2015.02.018
  29. Gouveia, L.; Martins, P.. "Solving the maximum edge-weight clique problem in sparse graphs with compact formulations". EURO Journal on Computational Optimization 3 1 (2015): http://www.scopus.com/inward/record.url?eid=2-s2.0-85015613030&partnerID=MN8TOARS.
    10.1007/s13675-014-0028-1
  30. Gouveia, L.; Lopes, M.J.; De Sousa, A.. "Single PON network design with unconstrained splitting stages". European Journal of Operational Research 240 2 (2015): 361-371. http://www.scopus.com/inward/record.url?eid=2-s2.0-84922338356&partnerID=MN8TOARS.
    10.1016/j.ejor.2014.07.006
  31. Benavent, E.; Corberán, Á.; Gouveia, L.; Mourão, M.C.; Pinto, L.S.. "Profitable mixed capacitated arc routing and related problems". TOP 23 1 (2015): 244-274. http://www.scopus.com/inward/record.url?eid=2-s2.0-84939874426&partnerID=MN8TOARS.
    10.1007/s11750-014-0336-x
  32. Botton, Q.; Fortz, B.; Gouveia, L.. "On the hop-constrained survivable network design problem with reliable edges". Computers and Operations Research 64 (2015): 159-167. http://www.scopus.com/inward/record.url?eid=2-s2.0-84933053191&partnerID=MN8TOARS.
    10.1016/j.cor.2015.05.009
  33. Gouveia, L.; Leitner, M.; Ljubic, I.. "The two-level diameter constrained spanning tree problem". Mathematical Programming 150 1 (2015): 49-78. http://www.scopus.com/inward/record.url?eid=2-s2.0-84925290997&partnerID=MN8TOARS.
    10.1007/s10107-013-0743-z
  34. Constantino, M.; Gouveia, L.; Mourão, M.C.; Nunes, A.C.. "The mixed capacitated arc routing problem with non-overlapping routes". European Journal of Operational Research 244 2 (2015): 445-456. http://www.scopus.com/inward/record.url?eid=2-s2.0-84925329432&partnerID=MN8TOARS.
    10.1016/j.ejor.2015.01.042
  35. Gouveia, L.; Ruthmair, M.. "Load-dependent and precedence-based models for pickup and delivery problems". Computers and Operations Research 63 (2015): 56-71. http://www.scopus.com/inward/record.url?eid=2-s2.0-84929630338&partnerID=MN8TOARS.
    10.1016/j.cor.2015.04.008
  36. Gouveia, L.; Moura, P.; Ruthmair, M.; Sousa, A.. "Spanning trees with variable degree bounds". European Journal of Operational Research 239 3 (2014): 830-841. http://www.scopus.com/inward/record.url?eid=2-s2.0-84906261491&partnerID=MN8TOARS.
    10.1016/j.ejor.2014.05.034
  37. Gollowitzer, S.; Gouveia, L.; Laporte, G.; Pereira, D.L.; Wojciechowski, A.. "A comparison of several models for the hamiltonian p-median problem". Networks 63 4 (2014): 350-363. http://www.scopus.com/inward/record.url?eid=2-s2.0-84901976242&partnerID=MN8TOARS.
    10.1002/net.21550
  38. Bektas, T.; Gouveia, L.. "Requiem for the Miller-Tucker-Zemlin subtour elimination constraints?". European Journal of Operational Research 236 3 (2014): 820-832. http://www.scopus.com/inward/record.url?eid=2-s2.0-84897914814&partnerID=MN8TOARS.
    10.1016/j.ejor.2013.07.038
  39. Gonçalves, G.M.; Gouveia, L.; Pato, M.V.. "An improved decomposition-based heuristic to design a water distribution network for an irrigation system". Annals of Operations Research 219 1 (2014): 141-167. http://www.scopus.com/inward/record.url?eid=2-s2.0-84904562083&partnerID=MN8TOARS.
    10.1007/s10479-011-1036-7
  40. Godinho, M.T.; Gouveia, L.; Pesneau, P.. "Natural and extended formulations for the Time-Dependent Traveling Salesman Problem". Discrete Applied Mathematics 164 PART 1 (2014): 138-153. http://www.scopus.com/inward/record.url?eid=2-s2.0-84893796204&partnerID=MN8TOARS.
    10.1016/j.dam.2011.11.019
  41. Gouveia, L.; Leitner, M.; Ljubic, I.. "Hop constrained Steiner trees with multiple root nodes". European Journal of Operational Research 236 1 (2014): 100-112. http://www.scopus.com/inward/record.url?eid=2-s2.0-84900647850&partnerID=MN8TOARS.
    10.1016/j.ejor.2013.11.029
  42. Gouveia, L.; Voß, S.. "Editorial". Networks 61 2 (2013): 87-88. http://www.scopus.com/inward/record.url?eid=2-s2.0-84873986577&partnerID=MN8TOARS.
    10.1002/net.21494
  43. Gollowitzer, S.; Gouveia, L.; Ljubic, I.. "Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities". European Journal of Operational Research 225 2 (2013): 211-222. http://www.scopus.com/inward/record.url?eid=2-s2.0-84870059048&partnerID=MN8TOARS.
    10.1016/j.ejor.2012.09.040
  44. Gouveia, L.; Salazar-González, J.-J.. "Polynomial-time separation of Enhanced Reverse Multistar inequalities". Operations Research Letters 41 3 (2013): 294-297. http://www.scopus.com/inward/record.url?eid=2-s2.0-84875949651&partnerID=MN8TOARS.
    10.1016/j.orl.2013.03.001
  45. Botton, Q.; Fortz, B.; Gouveia, L.; Poss, M.. "Benders decomposition for the hop-constrained survivable network design problem". INFORMS Journal on Computing 25 1 (2013): 13-26. http://www.scopus.com/inward/record.url?eid=2-s2.0-84877975414&partnerID=MN8TOARS.
    10.1287/ijoc.1110.0472
  46. Gouveia, L.; Riera-Ledesma, J.; Salazar-González, J.-J.. "Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route". Networks 61 4 (2013): 309-321. http://www.scopus.com/inward/record.url?eid=2-s2.0-84878642092&partnerID=MN8TOARS.
    10.1002/net.21481
  47. Duhamel, C.; Gouveia, L.; Moura, P.; De Souza, M.. "Models and heuristics for the k-degree constrained minimum spanning tree problem with node-degree costs". Networks 60 1 (2012): 1-18. http://www.scopus.com/inward/record.url?eid=2-s2.0-84863717984&partnerID=MN8TOARS.
    10.1002/net.20445
  48. Gouveia, L.; Scutellà, M.G.. "Editorial". Networks 59 1 (2012): 1-2. http://www.scopus.com/inward/record.url?eid=2-s2.0-83555166231&partnerID=MN8TOARS.
    10.1002/net.20474
  49. Gamvros, I.; Gouveia, L.; Raghavan, S.. "Reload cost trees and network design". Networks 59 4 (2012): 365-379. http://www.scopus.com/inward/record.url?eid=2-s2.0-84861792229&partnerID=MN8TOARS.
    10.1002/net.20443
  50. Gouveia, L.; Moura, P.. "Enhancing discretized formulations: The knapsack reformulation and the star reformulation". TOP 20 1 (2012): 52-74. http://www.scopus.com/inward/record.url?eid=2-s2.0-84859481805&partnerID=MN8TOARS.
    10.1007/s11750-011-0212-x
  51. Gouveia, L.; Simonetti, L.; Uchoa, E.. "Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs". Mathematical Programming 128 1-2 (2011): 123-148. http://www.scopus.com/inward/record.url?eid=2-s2.0-79957934437&partnerID=MN8TOARS.
    10.1007/s10107-009-0297-2
  52. Gouveia, L.; Paias, A.; Voß, S.. "Models for a traveling purchaser problem with additional side-constraints". Computers and Operations Research 38 2 (2011): 550-558. http://www.scopus.com/inward/record.url?eid=2-s2.0-77956397548&partnerID=MN8TOARS.
    10.1016/j.cor.2010.07.016
  53. Gouveia, L.; Moura, P.; De Sousa, A.. "Prize collecting Steiner trees with node degree dependent costs". Computers and Operations Research 38 1 (2011): 234-245. http://www.scopus.com/inward/record.url?eid=2-s2.0-78049451750&partnerID=MN8TOARS.
    10.1016/j.cor.2010.04.016
  54. Gouveia, L.; Patrício, P.; de Sousa, A.. "Models for optimal survivable routing with a minimum: Number of hops: Comparing disaggregated with: Aggregated models". International Transactions in Operational Research 18 3 (2011): 335-358. http://www.scopus.com/inward/record.url?eid=2-s2.0-80053009167&partnerID=MN8TOARS.
    10.1111/j.1475-3995.2010.00766.x
  55. Gouveia, L.; Paias, A.; Sharma, D.. "Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem". Journal of Heuristics 17 1 (2011): 23-37. http://www.scopus.com/inward/record.url?eid=2-s2.0-79951553114&partnerID=MN8TOARS.
    10.1007/s10732-009-9123-5
  56. Gouveia, L.; Mourão, M.C.; Pinto, L.S.. "Lower bounds for the mixed capacitated arc routing problem". Computers and Operations Research 37 4 (2010): 692-699. http://www.scopus.com/inward/record.url?eid=2-s2.0-70350567684&partnerID=MN8TOARS.
    10.1016/j.cor.2009.06.018
  57. Corte-Real, M.; Gouveia, L.. "A node rooted flow-based model for the local access network expansion problem". European Journal of Operational Research 204 1 (2010): 20-34. http://www.scopus.com/inward/record.url?eid=2-s2.0-70449658687&partnerID=MN8TOARS.
    10.1016/j.ejor.2009.10.001
  58. Fortz, B.; Gouveia, L.. "Networks: Editorial". Networks 55 3 (2010): 169-170. http://www.scopus.com/inward/record.url?eid=2-s2.0-77951248345&partnerID=MN8TOARS.
    10.1002/net.20361
  59. Gouveia, L.; Moura, P.. "Spanning trees with node degree dependent costs and knapsack reformulations". Electronic Notes in Discrete Mathematics 36 C (2010): 985-992. http://www.scopus.com/inward/record.url?eid=2-s2.0-77954948128&partnerID=MN8TOARS.
    10.1016/j.endm.2010.05.125
  60. Correia, I.; Gouveia, L.; Saldanha-da-Gama, F.. "Discretized formulations for capacitated location problems with modular distribution costs". European Journal of Operational Research 204 2 (2010): 237-244. http://www.scopus.com/inward/record.url?eid=2-s2.0-71649083073&partnerID=MN8TOARS.
    10.1016/j.ejor.2009.10.027
  61. Gouveia, L.; Salazar-González, J.-J.. "On the vehicle routing problem with lower bound capacities". Electronic Notes in Discrete Mathematics 36 C (2010): 1001-1008. http://www.scopus.com/inward/record.url?eid=2-s2.0-77954939854&partnerID=MN8TOARS.
    10.1016/j.endm.2010.05.127
  62. Godinho, M.T.; Gouveia, L.; Pesneau, P.. "Hop-indexed circuit-based formulations for the traveling salesman problem". Electronic Notes in Discrete Mathematics 36 C (2010): 1049-1056. http://www.scopus.com/inward/record.url?eid=2-s2.0-77954910739&partnerID=MN8TOARS.
    10.1016/j.endm.2010.05.133
  63. Agra, A.; Gouveia, L.; Requejo, C.. "Extended formulations for the cardinality constrained subtree of a tree problem". Operations Research Letters 37 3 (2009): 192-196. http://www.scopus.com/inward/record.url?eid=2-s2.0-64949184629&partnerID=MN8TOARS.
    10.1016/j.orl.2009.02.002
  64. Gouveia, L.. "Networks: Preface". Networks 53 2 (2009): 89-90. http://www.scopus.com/inward/record.url?eid=2-s2.0-63049096559&partnerID=MN8TOARS.
    10.1002/net.20277
  65. Gouveia, L.; Telhada, J.. "The multi-weighted Steiner tree problem: A reformulation by intersection". Computers and Operations Research 35 11 (2008): 3599-3611. http://www.scopus.com/inward/record.url?eid=2-s2.0-41149172424&partnerID=MN8TOARS.
    10.1016/j.cor.2007.03.003
  66. Gouveia, L.; Patrício, P.; de Sousa, A.. "Hop-constrained node survivable network design: An application to MPLS over WDM". Networks and Spatial Economics 8 1 (2008): 3-21. http://www.scopus.com/inward/record.url?eid=2-s2.0-38649089178&partnerID=MN8TOARS.
    10.1007/s11067-007-9038-3
  67. Gouveia, L.; Paias, A.; Sharma, D.. "Modeling and solving the rooted distance-constrained minimum spanning tree problem". Computers and Operations Research 35 2 (2008): 600-613. http://www.scopus.com/inward/record.url?eid=2-s2.0-34447097414&partnerID=MN8TOARS.
    10.1016/j.cor.2006.03.022
  68. Duhamel, C.; Gouveia, L.; Moura, P.; Souza, M.. "Models and heuristics for a minimum arborescence problem". Networks 51 1 (2008): 34-47. http://www.scopus.com/inward/record.url?eid=2-s2.0-38149127181&partnerID=MN8TOARS.
    10.1002/net.20194
  69. Godinho, M.T.; Gouveia, L.; Magnanti, T.L.. "Combined route capacity and route length models for unit demand vehicle routing problems". Discrete Optimization 5 2 (2008): 350-372. http://www.scopus.com/inward/record.url?eid=2-s2.0-41349118058&partnerID=MN8TOARS.
    10.1016/j.disopt.2007.05.001
  70. Correia, I.; Gouveia, L.; Saldanha-da-Gama, F.. "Solving the variable size bin packing problem with discretized formulations". Computers and Operations Research 35 6 (2008): 2103-2113. http://www.scopus.com/inward/record.url?eid=2-s2.0-35348992613&partnerID=MN8TOARS.
    10.1016/j.cor.2006.10.014
  71. Constantino, M.; Gouveia, L.. "Reformulation by discretization: Application to economic lot sizing". Operations Research Letters 35 5 (2007): 645-650. http://www.scopus.com/inward/record.url?eid=2-s2.0-34547598489&partnerID=MN8TOARS.
    10.1016/j.orl.2006.10.009
  72. Corte-Real, M.; Gouveia, L.. "Network flow models for the local access network expansion problem". Computers and Operations Research 34 4 (2007): 1141-1157. http://www.scopus.com/inward/record.url?eid=2-s2.0-33748950231&partnerID=MN8TOARS.
    10.1016/j.cor.2005.07.001
  73. Gouveia, L.; Voss, S.. "Networks: Preface". Networks 49 1 (2007): 1-2. http://www.scopus.com/inward/record.url?eid=2-s2.0-33947596845&partnerID=MN8TOARS.
    10.1002/net.20136
  74. Gouveia, L.; Saldanha-Da-Gama, F.. "On the capacitated concentrator location problem: A reformulation by discretization". Computers and Operations Research 33 5 (2006): 1242-1258. http://www.scopus.com/inward/record.url?eid=2-s2.0-26444551667&partnerID=MN8TOARS.
    10.1016/j.cor.2004.09.013
  75. Gouveia, L.; Pesneau, P.. "On extended formulations for the precedence constrained asymmetric traveling salesman problem". Networks 48 2 (2006): 77-89. http://www.scopus.com/inward/record.url?eid=2-s2.0-33747859898&partnerID=MN8TOARS.
    10.1002/net.20122
  76. Ben-Ameur, W.; Gouveia, L.. "Further contributions to network optimization". Networks 48 1 (2006): 1-6. http://www.scopus.com/inward/record.url?eid=2-s2.0-33746908585&partnerID=MN8TOARS.
    10.1002/net.20113
  77. Gouveia, L.; Magnanti, T.L.; Requejo, C.. "An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner trees". Annals of Operations Research 146 1 (2006): 19-39. http://www.scopus.com/inward/record.url?eid=2-s2.0-33747878362&partnerID=MN8TOARS.
    10.1007/s10479-006-0049-0
  78. Gouveia, L.; Lopes, M.J.. "The capacitated minimum spanning tree problem: On improved multistar constraints". European Journal of Operational Research 160 1 (2005): 47-62. http://www.scopus.com/inward/record.url?eid=2-s2.0-3943092534&partnerID=MN8TOARS.
    10.1016/j.ejor.2003.10.021
  79. Gouveia, L.; Martins, P.. "The capacitated minimum spanning tree problem: Revisiting hop-indexed formulations". Computers and Operations Research 32 9 (2005): 2435-2452. http://www.scopus.com/inward/record.url?eid=2-s2.0-12244291273&partnerID=MN8TOARS.
    10.1016/j.cor.2004.03.011
  80. Dahl, G.; Foldnes, N.; Gouveia, L.. "A note on hop-constrained walk polytopes". Operations Research Letters 32 4 (2004): 345-349. http://www.scopus.com/inward/record.url?eid=2-s2.0-2042473502&partnerID=MN8TOARS.
    10.1016/j.orl.2003.10.008
  81. Dahl, G.; Gouveia, L.. "On the directed hop-constrained shortest path problem". Operations Research Letters 32 1 (2004): 15-22. http://www.scopus.com/inward/record.url?eid=2-s2.0-0142242243&partnerID=MN8TOARS.
    10.1016/S0167-6377(03)00026-9
  82. Gouveia, L.; Magnanti, T.L.; Requejo, C.. "A 2-path approach for odd-diameter-constrained minimum spanning and steiner trees". Networks 44 4 (2004): 254-265. http://www.scopus.com/inward/record.url?eid=2-s2.0-9744253800&partnerID=MN8TOARS.
    10.1002/net.20034
  83. Ben-Ameur, W.; Gouveia, L.. "Some recent contributions to network optimization". Networks 44 1 (2004): 27-30. http://www.scopus.com/inward/record.url?eid=2-s2.0-4043171983&partnerID=MN8TOARS.
    10.1002/net.20010
  84. Gouveia, L.; Patrício, P.; De Sousa, A.F.; Valadas, R.. "MPLS over WDM network design with packet level QoS constraints based on ILP models". Proceedings - IEEE INFOCOM 1 (2003): 576-586. http://www.scopus.com/inward/record.url?eid=2-s2.0-0042474488&partnerID=MN8TOARS.
  85. Gouveia, L.; Magnanti, T.L.. "Network Flow Models for Designing Diameter-Constrained Minimum-Spanning and Steiner Trees". Networks 41 3 (2003): 159-173. http://www.scopus.com/inward/record.url?eid=2-s2.0-2142795873&partnerID=MN8TOARS.
    10.1002/net.10069
  86. Gouveia, L.; Hall, L.. "Multistars and Directed Flow Formulations". Networks 40 4 (2002): 188-201. http://www.scopus.com/inward/record.url?eid=2-s2.0-0141429897&partnerID=MN8TOARS.
    10.1002/net.10050
  87. Gouveia, L.; Requejo, C.. "A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem". European Journal of Operational Research 132 3 (2001): 539-552. http://www.scopus.com/inward/record.url?eid=2-s2.0-0035427762&partnerID=MN8TOARS.
    10.1016/S0377-2217(00)00143-0
  88. Gouveia, L.; Pires, J.M.. "The asymmetric travelling salesman problem: On generalizations of disaggregated Miller-Tucker-Zemlin constraints". Discrete Applied Mathematics 112 1-3 (2001): 129-145. http://www.scopus.com/inward/record.url?eid=2-s2.0-0035885276&partnerID=MN8TOARS.
    10.1016/S0166-218X(00)00313-9
  89. Gouveia, L.; Manuel Pires, J.. "Models for a Steiner ring network design problem with revenues". European Journal of Operational Research 133 1 (2001): 21-31. http://www.scopus.com/inward/record.url?eid=2-s2.0-0035899627&partnerID=MN8TOARS.
    10.1016/S0377-2217(00)00144-2
  90. Gouveia, L.; Telhada, J.. "An Augmented Arborescence Formulation for the Two-Level Network Design Problem". Annals of Operations Research 106 1-4 (2001): 47-61. http://www.scopus.com/inward/record.url?eid=2-s2.0-0035567111&partnerID=MN8TOARS.
    10.1023/A:1014553523631
  91. Gouveia, L.; Martins, P.. "A hierarchy of hop-indexed models for the capacitated minimum spanning tree problem". Networks 35 1 (2000): 1-16. http://www.scopus.com/inward/record.url?eid=2-s2.0-0033633209&partnerID=MN8TOARS.
  92. Gouveia, L.; Lopes, M.J.. "Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs". European Journal of Operational Research 121 2 (2000): 394-411. http://www.scopus.com/inward/record.url?eid=2-s2.0-0033905818&partnerID=MN8TOARS.
    10.1016/S0377-2217(99)00043-0
  93. Gouveia, L.; Pires, J.M.. "The asymmetric travelling salesman problem and a reformulation of the Miller-Tucker-Zemlin constraints". European Journal of Operational Research 112 1 (1999): 134-146. http://www.scopus.com/inward/record.url?eid=2-s2.0-0032736580&partnerID=MN8TOARS.
  94. Gouveia, L.; Martins, P.. "The Capacitated Minimal Spanning Tree Problem: An experiment with a hop-indexed model". Annals of Operations Research 86 (1999): 271-294. http://www.scopus.com/inward/record.url?eid=2-s2.0-0033425803&partnerID=MN8TOARS.
  95. Gouveia, L.; Janssen, E.. "Designing reliable tree networks with two cable technologies". European Journal of Operational Research 105 3 (1998): 552-568. http://www.scopus.com/inward/record.url?eid=2-s2.0-0032028626&partnerID=MN8TOARS.
  96. Gouveia, L.. "Using variable redefinition for computing lower bounds for minimum spanning and Steiner trees with hop constraints". INFORMS Journal on Computing 10 2 (1998): 180-188. http://www.scopus.com/inward/record.url?eid=2-s2.0-0001276437&partnerID=MN8TOARS.
  97. Fernandes, L.M.; Gouveia, L.. "Minimal spanning trees with a constraint on the number of leaves". European Journal of Operational Research 104 1 (1998): 250-261. http://www.scopus.com/inward/record.url?eid=2-s2.0-0031698493&partnerID=MN8TOARS.
  98. Gouveia, L.; Lopes, M.J.. "Using generalized capacitated trees for designing the topology of local access networks". Telecommunication Systems 7 4 (1997): 315-337. http://www.scopus.com/inward/record.url?eid=2-s2.0-21744455359&partnerID=MN8TOARS.
  99. Gouveia, L.. "Multicommodity flow models for spanning trees with hop constraints". European Journal of Operational Research 95 1 (1996): 178-190. http://www.scopus.com/inward/record.url?eid=2-s2.0-0030283804&partnerID=MN8TOARS.
    10.1016/0377-2217(95)00090-9
  100. Gouveia, L.. "A result on projection for the vehicle routing ptoblem". European Journal of Operational Research 85 3 (1995): 610-624. http://www.scopus.com/inward/record.url?eid=2-s2.0-58149318797&partnerID=MN8TOARS.
    10.1016/0377-2217(94)00025-8
  101. Gouveia, L.; Voß, S.. "A classification of formulations for the (time-dependent) traveling salesman problem". European Journal of Operational Research 83 1 (1995): 69-82. http://www.scopus.com/inward/record.url?eid=2-s2.0-0041779428&partnerID=MN8TOARS.
    10.1016/0377-2217(93)E0238-S
  102. Gouveia, L.. "Using the Miller-Tucker-Zemlin constraints to formulate a minimal spanning tree problem with hop constraints". Computers and Operations Research 22 9 (1995): 959-970. http://www.scopus.com/inward/record.url?eid=2-s2.0-0029411882&partnerID=MN8TOARS.
    10.1016/0305-0548(94)00074-I
  103. Gouveia, L.. "A 2n constraint formulation for the capacitated minimal spanning tree problem". Operations Research 43 1 (1995): 130-141. http://www.scopus.com/inward/record.url?eid=2-s2.0-0003303487&partnerID=MN8TOARS.
    10.1287/opre.43.1.130
  104. Gouveia, L.. "A comparison of directed formulations for the capacitated minimal spanning tree problem". Telecommunication Systems 1 1 (1993): 51-76. http://www.scopus.com/inward/record.url?eid=2-s2.0-0001773019&partnerID=MN8TOARS.
    10.1007/BF02136155
  105. Gouveia, L.; Paixão, J.. "Dynamic programming based heuristics for the topological design of local access networks". Annals of Operations Research 33 4 (1991): 305-327. http://www.scopus.com/inward/record.url?eid=2-s2.0-0006111915&partnerID=MN8TOARS.
    10.1007/BF02071978
Livro
  1. Fortz, B.; Gouveia, L.; Moniz, M.. Mathematical programming models for traffic engineering in Ethernet networks implementing the multiple spanning tree protocol. 2014.
    10.1007/978-3-319-09174-7_21
  2. Fouilhoux, P.; Gouveia, L.E.N.; Mahjoub, A.R.; Paschos, V.T.. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface. 2014.
  3. Gouveia, L.; Leitner, M.; Ljubic, I.. On the hop constrained steiner tree problem with multiple root nodes. 2012.
    10.1007/978-3-642-32147-4_19
  4. Gollowitzer, S.; Gouveia, L.; Ljubic, I.. The two level network design problem with secondary hop constraints. 2011.
    10.1007/978-3-642-21527-8_9
  5. Gouveia, L.; Patrício, P.; De Sousa, A.. Lexicographical minimization of routing hops in telecommunication networks. 2011.
    10.1007/978-3-642-21527-8_27
  6. Gouveia, L.; Telhada, J.. Reformulation by intersection method on the MST problem with lower bound on the number of leaves. 2011.
    10.1007/978-3-642-21527-8_11
  7. Gouveia, L.; Moura, P.; De Sousa, A.. Spanning trees with generalized degree constraints arising in the design of wireless networks. 2011.
    10.1007/978-3-642-21527-8_10
  8. Cappanera, P.; Gouveia, L.; Scutellà, M.G.. The skill vehicle routing problem. 2011.
    10.1007/978-3-642-21527-8_40
  9. Gollowitzer, S.; Gouveia, L.; Ljubic, I.. A node splitting technique for two level network design problems with transition nodes. 2011.
    10.1007/978-3-642-21527-8_8
  10. Gouveia, L.; Patrício, P.; de Sousa, A.. Optimal Survivable Routing with a Small Number of Hops. 2008.
  11. Gouveia, L.; Patrício, P.; de Sousa, A.. Compact models for hop-constrained node survivable network design: An application to MPLS. 2006.
    10.1007/0-387-29234-9_9
Atividades

Orientação

Título / Tema
Papel desempenhado 		Curso (Tipo)
Instituição / Organização
2023/02 - Atual Estudo de Formulações Naturais e Estendidas para o Problema da p-Mediana Hamiltoniana
Orientador
 Doutoramento em Estatística e Investigação Operacional (Doutoramento)
2020/02 - 2023/07 The Traveling Salesman Problem with Positional Consistency Constraints
Coorientador
 Doutoramento em Estatistica e Investigação Operacional (Doutoramento)
Universidade de Lisboa Faculdade de Ciências, Portugal
2016/09 - 2019/04 Models For Multi-Depot Routing Problems
Orientador
 Doutpramento em Estatistica e Investigação Operacional
Universidade de Lisboa Faculdade de Ciências, Portugal
2014/09 - 2018/07 Modelos de Programação Linear Inteira para Planeamento de Operações de Busca e Vigilância Marítima
Coorientador
 Doutoramento em Estatística e Investigação operacional (Doutoramento)

Membro de associação

Nome da associação Tipo de participação
2007/01 - Atual European Network Optimization Group (ENOG), a working group within EURO, the Association of European Operational Research Societies Co-coordenação
2012/01 - 2014/01 Secção de Telecomunicações da Institute for Operations Research and the Management Sciences (INFORMS) President