Personal Data

Full name

Luis Eduardo Neves Gouveia

Publishing name

Luis Eduardo Neves Gouveia

Birthday

1957-10-15T00:00:00

Academic Degrees

AGREGAÇÃO(0)

Degree date

2000

Final grade

Aprovado com Unanimidade

Degree granting institution

Universidade de Lisboa

School / College / Campus

Faculdade de Ciências

Thesis title

Supervisor

Co-supervisor

Scientific area

Profissional activity

Period Position Institution
17-01-2012 - Professor Catedrático / Full Professor Faculdade de Ciências da Universidade de Lisboa

Area of scientific activity

Area of scientific activity

Applied Mathematics / Operations Research / Network Optimization

Specialization domain

Operations Research / Integer Programming / Model Reformulation, Graphs

Current main scientific area

Integer Programming / Model Reformulation, Network Design, Graphs, Properties of Graphs in Modelling Networks

Other scientific activities

Coordinator of the Centro de Investigação Operacional (CIO) da Faculdade de Ciências da Universidade de Lisboa, (since July 2003). Centro classified as "Escellent" in the (2008) FCT evaluation.

The CIO was merged with the Unit CMAF in 2012, resulting in the CMAFcIO.
Coordinator of the CMAFcIO since January 2018

Co-Coordinator of the European Network Optimization Group since September 2007
Chair of the Telecomunications Section of INFORMS in 2012-2014.

President of the Department of Statistics and Operations Reserach since November 2012.

Experience as scientific advisor

Currently supervising 2 Phd Thesis by:

Daniel Santos, “Linear Integer Models for Multi-Depot Routing probelms and some variants", PHd Thesis in Statistics and Operations Research (speciality Optimization), Faculty of Sciences of the University of Lisbon.

Rui de Deus, “Linear Integer Models for Planning mass rescue operations in a major oceanic accident with passenger ships in collaboration with the Portuguese Navy. Study of a new variant of the Vehicle routing problem", PHd Thesis in Statistics and Operations Research (speciality Optimization), Faculty of Sciences of the University of Lisbon.

Supervised the following 10 Phd Thesis (titles translated to English):

Maria Teresa Godinho, “Time-dependent models for routing problems”, PHd Thesis in Statistics and Operations Research (speciality Optimization), Faculty of Sciences of the University of Lisbon, December 2011.

Pedro Martins Pereira Serrão de Moura “Models for minimum spanning trees with node degree dependente costs”, PHd Thesis in Statistics and Operations Research (speciality Optimization), Faculty of Sciences of the University of Lisbon. December 2009.

Pedro Mendes Ferrão Simões Patrício,“ILP models for dimensioning and traffic negineering problems in telecommunication networks”, PHd Thesis in Statistics and Operations Research (speciality Optimization), Faculty of Sciences of the University of Lisbon. July 2009.

Margarida Corte Real Gonçalves, “On models for the expansion of local access networksLocal”, PHd Thesis in Statistics and Operations Research (speciality Optimization), Faculty of Sciences of the University of Lisbon. April 2009.

Graça, Gonçalves, "Optimization models for the design of water irrigation networks" , PHd in Mathematics (Speciality Operations Research), in the faculty of Sciences of Technology of the Universidade Nova de Lisboa, December 2008.
(Co-supervision with com Margarida Vaz Pato do Instituto Superior de Economia e Gestão)


João Miguel Paixão Telhada, "Hierarchical Network Design", Doutoramento em Estatística e Investigação Operacional (Especialidade de Optimização), PHd Thesis in Statistics and Operations Research (speciality Optimization), Faculty of Sciences of the University of Lisbon, March 2004

Cristina Requejo, “Models for minimum spanning trees with a diamter constraint: the case with odd diameter", PHd Thesis in Statistics and Operations Research (speciality Optimization), Faculty of Sciences of the University of Lisbon, January 2004.

Maria João Caldas Frazão Lopes, "Spanning trees with capacity constraints, flow costs and non unit demands ", PHd Thesis in Statistics and Operations Research (speciality Optimization), Faculty of Sciences of the University of Lisbon, April 2003.

José Manuel de Oliveia Pires "Models for the asymmetric traveing salesman problems and their application to ring netwoprk design", PHd Thesis in Statistics and Operations Research (speciality Optimization), Faculty of Sciences of the University of Lisbon, 2002

Pedro João Coimbra Martins, "The capacitated minimum Spanning tree problem: hop-indexed models, PHd Thesis in Statistics and Operations Research (speciality Optimization), Faculty of Sciences of the University of Lisbon, 2000.

Since 1993, has supervised 17 master Thesis at the faculty of Sciences, University of Lisbon.

Participations in R&D projects

SUPERVISION of Research Units, Research Groups and Projects

Coordinator of the Centro de Investigação Operacional da Faculdade de Ciências da Universidade de Lisboa, (since
July 2003). Centro classified as "Escellent" in the last (2008) FCT evaluation.

Co-Coordinator of the European Network Optimization group since September 2007.

Chair of the INFORMS Technical Section on Telecommunications (from 2012 to 2014).

Coordinator of the Project PTDC / EIA / 64772 / 2006,
"TelNet - Redes de Telecomunicações Robustas: Metodos de Optimização para o Desenho Topológico, Dimensionamento e Engenharia de Tráfego", Fundação para a Ciência e Tecnologia.

Coordinator of the Project POSI / CPS / 41459 / 2001, "MULTIDIM,
Dimensioning Multi-Service and Multi- Layer Networks: Optimization Models", Fundação para a Ciência e Tecnologia.
Classified as "Very Good" by FCT.

Coordinator of the Project PBIC / C / MAT / 2130 / 95, de 1995 a 1998, intitulado “Modelos de Optimização Combinatória para o Desenho Topológico de Redes de Telecomunicações”, Fundação para a Ciência e Tecnologia.

MEMBERSHIP in Reseach Units, Research Groups and Projects

Member of the Board of the European Network Optimization group since 2005.

Secretary, INFORMS Technical Section on Telecommunications
since 2006.



Member of the Centro de Investigação Operacional da Faculdade de Ciências da Universidade de Lisboa, Coordinator Professor José Manuel Pinto Paixão (since 1994 to July 2003).

Member of the Centro de Estatística e Aplicações da Universidade de Lisboa, linha 4 titled "Optimização e Aplicações", from 1985 to 1994. Coordinated by Prof. José Paixão.

Member of the team in Project PRAXIS / P / EEI / 12135 / 98, intitulado “Algortimos para Optimização de Dimensionamento e Gestão de Recursos em Redes de Telecomunicações”, Fundação para a Ciência e Tecnologia, Coordinator is Eng. Rui Valadas of the Instituto de Telecomunicações (Polo de Aveiro)

Member of the team of the Project PRAXIS / 2 / 2.1 / MAT / 139 / 94, subsidiado de pela Fundação para a Ciência e Tecnologia, sendo investigador responsável o Prof. Dr. José Paixão.

Member of the team of the Project STRDA / C / CEG / 426 / 92, no âmbito do Programa STRIDE, sobre ´Modelos de Optimização Combinatória: Aplicações e Extensões´, Coordinator is Prof. Dr. José Paixão.

Member of the team of the Project nº 809.86.148 - "Idealização Topológica de Redes", unta Nacional de Investigação Científica e Tecnológica, Coordinator is Prof. Dr. José Paixão.

Awards

Year Award Awarding entity

Publications

Artigos em revistas de circulação internacional com arbitragem científica

  • Nearly 90 publications in journal and book chapters (5). Nearly 40 papers published in Proceedings of Conferences (e.g., LNCS and ENDM issues) of which 35 have been expanded into papers (included in the list below).

    (Accepted for publication - 3)

    *L. Gouveia, M. Leitner and M. Joyce-Moniz, " Branch and cut methods for the network design problem with vulnerability constraints”, Computers & Operations in press.

    Bernard Fortz, Luís Gouveia, Martim Joyce-Moniz "Optimal design of switched Ethernet networks implementing the Multiple Spanning Tree Protocol" Discrete Applied Mathematics, available online August 2016,

    L. Gouveia, P. Pesneau, M. Ruthmair and D. Santos, “Combining and projecting flow models for the (precedence constrained) asymmetric traveling salesman problem” Networks, in press.

    Publications in Journals (> 80)

    T. Bektas, L. Gouveia and D. Santos, “New path elimination constraints for multi-depot routing problems” Networks, Volume 70, Issue 3, August 2017, pages 908-928.

    Luis Gouveia, Markus Leitner and Mario Ruthmair, " Extended Formulations and Branch-and-Cut Algorithms for the Black-and-White Traveling Salesman Problem", European Journal of Operational Research, Vol 262, November 2017, Pages 908--928.

    Bernard Fortz, Luís Gouveia, Martim Joyce-Moniz "Models for the piecewise linear unsplittable multicommodity flow problems", European Journal of Operational Research, vol. 261, issue 1, August 2017, 30-42.

    Bernard Gendron, Luis Gouveia "Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems", Transportation Science, Volume 51, Issue 2, May 2017, Pages 629-649.

    L. Gouveia and L. Simonetti., "Spanning trees with a constraint on the number of leaves", Computers & Operations Research, May 2017, vol. 81, pages 257-268.

    L. Gouveia, M. Leitner, "Design of survivable networks with vulnerability constraints", European Journal of Operational Research, Volume 258, Issue 1, 1 April 2017, Pages 89–103.

    I. Diarrassouba, V. Gabrel, A. R. Mahjoub, L. Gouveia and P. Pesneau, "Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem, Networks, Vol 67, pp 148–169, 2016.

    A.Bautzer, L. Gouveia, A. Paias, J. Pires, “Models for a Steiner multi-ring network design problem with revenues”, TOP, 24 (2), pp 360-380.

    L. Gouveia, M. Ruthmair, D. Santos, "Um modelo de fluxo para o electric traveling salesman problemin" A Investigação Operacional em Portugal - novos desafios novas ideias (C.H. Antunes, D.M. Cardoso, F.N. da Silva Eds.) IST Press, pp 133-143, Lisboa, 2016

    Gouveia, L., Patrício, P., Sousa, A., "Lexicographical minimization of routing hops in hop-constrained node survivable networks", Telecommunication Systems, June 2016, Volume 62, Issue 2, pp 417-434.

    Botton, Q., Fortz, B., Gouveia, L., "On the hop-constrained survivable network design problem with reliable edges ", Computers & Operations Research, November 2015, vol. 64, pages 159-167.

    Gouveia, L., Ruthmair, M., "Load-dependent and precedence-based models for pickup and delivery problems", Computers & Operations Research, November 2015, vol. 63, pages 56-71.

    Catanzaro, D., Gouveia, L., Labbé, M. “Improved integer linear programming formulations for the job Sequencing and tool Switching Problem” European Journal of Operational Research, vol. 244, Issue 3, 1 August 2015, Pages 766–777

    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, Volume 244, Issue 2, 16 July 2015, Pages 445–456

    Gouveia, L., Leitner, M., Ljubic, I. “The two-level diameter constrained spanning tree problem” Mathematical Programming, April 2015, vol. 150, Issue 1, pp 49-78.

    Benavent, E., Corberán, Á., Gouveia, L., Mourão, M.C., Pinto, L.S. “Profitable mixed capacitated arc routing and related problems”, TOP April 2015, Volume 23, Issue 1, pp 244-274.

    Gouveia, L., Lopes, M.J., A. de Sousa, “Single PON network design with unconstrained splitting stages", European Journal of Operational Research,. 240, Issue 2, January 2015, pp. 361-371.

    Gouveia, L., P. Moura, M. Ruthmair, A. Sousa "Spanning trees with variable degree bounds" European Journal of Operational Research, vol. 239, Issue 3, 16 December 2014, pp. 830–841
    (http://dx.doi.org/10.1016/j.ejor.2014.05.034)

    Bektas, T. and L. Gouveia, “A requiem for the Miller-Tucker-Zemlin constraints ?”, European Journal of Operational Research, Vol 236, Issue 3, 1 August 2014, Pages 820–832,
    (http://dx.DOI: 10.1016/j.ejor.2013.07.038)

    Gouveia, L., Leitner, M. and I. Ljubic. "Hop Constrained Steiner Trees with multiple Root Nodes", European Journal of Operational Research, Vol 236, issue 1, pp 100–112, 2014. (DOI:10.1016/j.ejor.2013.11.029)

    Gouveia, L. e J.J. Salazar-González, “Polynomial-time separation of Enhanced Reverse Multistar Inequalities”, O. R. Letters, Volume 41, Issue 3, May 2013, pp. 294–297 (http://dx.doi.org/10.1016/j.orl.2013.03.001)

    Gollowitzer, S., L. Gouveia e I. Ljubic, “Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities”, European Journal of Operational Research, vol. 225, Issue 2, 1 March 2013, pp. 211–222 (http://dx.doi.org/10.1016/j.ejor.2012.09.040)

    Capanera, P., L. Gouveia e M. G. Scutellá, “Models and valid inequalities to asymmetric skill-based routing problems”, EURO Journal on Transportation and Logistics, May 2013, vol. 2, Issue 1-2, pp 29-55 (http://dx.doi.org/10.1007/s13676-012-0012-y)

    Gouveia, L., J. Riera-Ledesma e J.J. Salazar-González, “Reverse Multistar Inequalities and Vehicle Routing Problems with a Lower Bound on the Number of Clients per Route”, Networks, vol. 61, Issue 4, pp. 309–321, July 2013 (http://dx.doi.org/10.1002/net.21481)

    Godinho, M.T., L. Gouveia e P. Pesneau, "Natural and Extended Formulations for the Time-Dependent Travelling Salesman Problem" Discrete Applied Mathematics, vol. 164, Part 1, 19 February 2014, pp. 138–153, (número especial dedicado à conferência ISCO 2010) (http://dx.doi.org/10.1016/j.dam.2011.11.019)

    Botton, Q., Fortz, B., Gouveia, L., e Poss, M.,“Benders Decomposition for the Hop-Constrainted Survivable Network Design Problem”, Informs Journal on Computing, vol. 25, Issue 1, Winter 2013, pp. 13-26 http://dx.doi.org/10.1287/ijoc.1110.0472

    Gouveia, L., e P. Moura,“Enhancing Discretized Formulations: the Knapsack Reformulation and the Star Reformulation”, Vol. 20 (1) pp. 52-74, 2012, (número especial dedicado ao Prof. Dr. Joaquim Júdice). (DOI) 10.1007/s11750-011-0212-x

    Duhamel, C., Gouveia, L., Moura, P., e Souza, M., "Models and heuristics for the k -degree constrained minimum spanning tree problem with node-degree costs" Vol. 60, (1), pp 1–69, 2012. (DOI) 10.1002/net.20445.

    Gamvros, I., Gouveia, L., e Raghavan, S., “Reload Cost Trees and Network Design”, Vol. 59 (4) pp. 365-379, 2012. (DOI) 10.1002/net.20443

    Godinho, M.T., L. Gouveia e P. Pesneau, "On a Time-Dependent Flow-Based formulation and an updated Classification of Formulations for the Travelling Salesman Problem”, em “Progress in Combinatorial Optimization”, editado por R. Mahjoub, Wiley, November 2011, Chapter 7, pp.223-252 ISBN: 9781848212060

    Gouveia, L., L. Simonetti, e Uchoa, E., “Modelling Hop-Constrained and Diameter-Constrained Minimum Spanning Tree Problems as Steiner Tree Problems over Layered Graphs”, Mathematical Programming, 128, pp 123-148, 2011.

    Gouveia, L., Paias, A., e Sharma, D., “Restricted Dynamic Programming Based Neighborhoods for the Hop-Constrained Minimum Spanning Tree Problem”, Journal of Heuristics, 17, pp 23-37, 2011.

    Gouveia, L., Patrício, P. e Sousa, A., “Models for Optimal Survivable Routing with a Minimum Number of Hops: Comparing Disaggregated with Aggregated Models”, International Transactions of Operations Research, 18, 335-358, 2011.

    Gouveia, L., Moura P., e Sousa, A., “"Prize Collection Steiner Trees with Node Degree Dependent Costs", Computers & Operations Research 38, pp. 234-245, 2011.

    Gouveia, L., Paias, A., e Voss, S., “Models for a Travelling Purchaser Problem with Additional Side-Constraints”, Computers & Operations Research 38, pp. 550-558, 2011

    Gollowitzer, S., L. Gouveia e I. Ljubic, “The Two Level Network Design Problem with Secondary Hop Constraints”, Lecture Notes in Computer Science, Proceedings of INOC 2011, 6701, pp 71-76, 2011.

    Gouveia, L., P. Moura e A. Sousa “Spanning Trees with Generalized Degree Constraints arising in the Design of Wireless Networks”, Lecture Notes in Computer Science, Proceedings of INOC 2011, 6701, pp 77-82, 2011.

    Gouveia, L. and J. Telhada, “Reformulation by Intersection Method on the MST Problem with Lower Bound on the Number of Leaves”, Lecture Notes in Computer Science, Proceedings of INOC 2011, 6701, pp 83-91, 2011.

    Gouveia, L., P. Patricio e A. Sousa “Lexicographical Minimization of Routing Hops in Telecommunication Networks”, Lecture Notes in Computer Science, Proceedings of INOC 2011, 6701, pp 216-298, 2011.

    Gouveia, L., Mourão, C. e Pinto, L., “Lower Bounds for the Mixed Capacitated Arc Routing Problem, Computers and Operations Research, 37, pp 692-699, 2010.

    Gonçalves, M. e Gouveia, L., “A Node Rooted Flow-Based Model for the Local Access Network Expansion Problem” European Journal of Operational Research 204, pp. 20-34, 2010.

    Correia, I., Gouveia, L., e Saldanha da Gama, F., “Discretized formulations for capacitated location problems with modular distribution costs”, European Journal of Operational Research, 204, pp 237-244, 2010.

    Gouveia, L., e Telhada, J., ” The Multi-Weighted Steiner Tree Problem: A Reformulation by Intersection”, Computers & Operations Research, 35, pp 3599-3611, 2008.

    Godinho, M.T., Gouveia, L., and Magnanti, T., “Combined Route Capacity and Route Length Models for Unit Demand Vehicle Routing Problems”, Discrete Optimization, Vol 5, pp 350-372, 2008 (special issue in honor of George Dantzig).

    Gouveia, L., Patrício, P.F., Sousa, A.F., "Optimal Survival Routing with a small number of Hops”, aceite para publicação em Telecommunications Modeling, Policy, and Technology”, ed. S. Raghavan, B. Golden and E, Wasil, (special issue associated to the 2008 INFORMS Telecommmunications Conference) Springer, pp 253-274, 2008.

    Gouveia, L., Patrício, P.F., e Sousa, A.F., "Optimal Survival Routing with a small number of Hops”, em Telecommunications Modeling, Policy, and Technology”, ed. S. Raghavan, B. Golden and E, Wasil, (edição especial associada à conferência INFORMS Telecommmunications 2008) Springer, pp 253-274, 2008.

    Gouveia, L., Patrício, P.F., Sousa, A.F., " Hop-Contrained Node Survivable Network Design: An Application to MPLS over WDM” Networks and Spatial Economics, Vol. 8, No. 1, March 2008, pp. 3-21 (special issue associated with the 2006 INFORMS Telecommunications Conference).

    Correia, I., Gouveia, L., and Saldanha da Gama, F., “Solving the variable size bin packing problem with discretized formulations”, Computers & Operations Research, Vol 35, pp 2103.2113, 2008.

    Gouveia, L., Paias, A., and Sharma, D., “Modeling and Solving the Rooted Distance-Constrained Minimum Spanning Tree Problem”, Computers & Operations Research, Vol 35, pp 600-613, 2008.

    Duhamel, C., Gouveia, L., Moura, P., and Souza, M., “Models and Heuristics for a Minimum Arborescence Problem”, Networks. Vol 51, pp 34-47, 2008 (issue in memory of Stefano Pallotino).

    Gonçalves, M., and Gouveia, L., “Network Flow Models for the Expansion of Local Access Networks”, Computers & Operations Research, Vol 34, 1141-1157, 2007.

    Gouveia, L., Magnanti, T. e Requejo, C., “An Intersecting Tree Model for Odd-Diameter-Constrained Minimum Spanning and Steiner Trees” Annals of Operations Research, Vol 146 (dedicado à Conferência INOC 2003 – International Network Optimization Conference, editado por Walid Ben-Ameur, Dan Bienstock and Iraj Saniee, pp 19-39, 2006.

    Gouveia, L. and Pesneau, P., “Solving the Precedence Constrained Asymmetric Traveling Salesman Problem with an Extended Formulation”, Networks. Vol 48, pp 77-89, 2006.

    Dahl, G., Gouveia, L., and Requejo, C., “On Formulations and Methods for the Hop-Constrained Minimum Spanning Tree Problem”, Handbooks of Telecommunications, Eds. Panos Pardalos and Mauricio Resende, Springer, pp 493-515, 2006.

    Gouveia, L., e Saldanha da Gama, F., “Location Models: a Reformulation by Discretization” Computers & Operations Research, Vol 33, pp 1242-1258, 2006.

    Gouveia, L., Patrício, P.F., Sousa, A.F., "Compact models for hop-constrained node survivable network design” Telecommunications Network Planning: Innovations in Pricing, Network Design and Management, ed. G. Anandaligam and S. Raghavan, Springer, 2005.

    Gouveia, L., e Martins, P., “The Capacitated Minimum Spanning Tree Problem: Revisiting Hop-Indexed Models” Computers & Operations Research, Vol 32, pp 2435-2452, 2005.

    Gouveia, L. e Lopes, M. J., “The Capacitated Minimum Spanning Tree Problem: On Improved Multistar Constraints”, European Journal of Operational Research, Vol 160, pp 47-62, 2005.

    Gouveia, L., Magnanti, T. e Requejo, C., “A 2-Path Approach for Odd-Diameter-Constrained Minimum Spanning and Steiner Trees” Networks. Vol 44, pp 254-265, 2004.

    Dahl, G., Gouveia, L., and Foldnes, N., “A note on hop-constrained walk polytopes”, O.R. Letters, Vol 32, pp 345-349, 2004.

    Dahl, and Gouveia, L., “On the directed hop-constrained shortest-path problem” O.R. Letters, Vol 32, pp 15-22, 2004.

    Gouveia, L. and Magnanti, T., “Network Models for Designing Diameter-Constrained Minimum-Spanning and Steiner Trees”, Networks, Vol. 41, pp 159-173, 2003.

    Gouveia, L. and Hall, L., “Mulistars and Directed Flow Formulations”, Networks, Vol. 40, pp 188-201, 2003.

    Gouveia, L., e Telhada, J., ”An Augmented Arborescence Formulation for the Two-Level Network Design Problem”, Ann Oper Res, Volume 106 intitulado "Topological Network Design in Telecommunications Systems", pp 47-62, 2001.

    Gouveia, L. e Pires, J.M., ‘The Asymmetric Travelling Salesman Problem: On Generalizations of Disaggegated Miller-Tucker-Zemlin Constraints”, Discrete Applied Mathematics, Vol 122, pp 129-145, 2001.

    Gouveia, L. e Pires, J.M, "Models for a Steiner Ring Network Design Problem with Revenues", European Journal of Operational Research, Vol 133, pp 21-31, 2001.

    Gouveia, L., e Requejo, C., “A New Lagrangean Relaxation Approach for the Hop-Constrained Minimum Spanning Tree Problem", European Journal of Operational Research, Vol 132, pp 539-552, 2001.

    Gouveia, L. e Lopes, M. J., “Valid Inequalities for Non-Unit Demand Capacitated Spanning Tree Problems with Flow Costs", European Journal of Operational Research, Vol 121, pp 394-411, 2000.

    Gouveia, L. e Martins, P.,"A Hierarchy of Hop-Indexed Models for the Capacitated Minimum Spanning Tree Problem", Networks, Vol 35, pp 1-16, 2000.

    Gouveia, L., "Using Hop-Indexed Models for Constrained Spanning and Steiner Tree Problems", no livro “Telecommunications Network Planning”, B. Samsò and P. Soriano, Eds., 21-32, 1999.

    Gouveia, L. e Martins, P.,"The Capacitated Minimum Spanning Tree: An Experiment with a Hop Indexed Model", Ann Oper Res, Volume 86 intitulado "Recent Advances in Combinatorial Optimization", pp 271-294, 1999.

    Gouveia L., "Using Variable Redefinition for Computing Minimum Spanning and Steiner Trees with Hop Constraints", INFORMS Journal on Computing, Vol 10, pp 180-188, 1998.

    Gouveia, L. e Pires, J.M, "The Asymmetric Traveling Salesman Problem and a Reformulation of the Miller-Tucker-Zemlin Constraints", European Journal of Operational Research, Vol 112, pp 134-146, 1999.

    Gouveia, L. e Janssen, E., "Designing Reliable Tree Networks with Two-Cable Technologies", European Journal of Operational Research, Vol 105, pp 552-568, 1998.

    Fernandes, M.L. e Gouveia, L., "Minimal Spanning Trees with a Constraint on the Number of Leaves", European Journal of Operational Research, Vol 104, pp 250-261, 1998.

    Gouveia, L. e Lopes, M.J.,"Using Generalized Capacitated Trees for Designing the Topology of Local Access Networks", Telecommunications Systems and Modelling, Vol 7, pp 315-337, 1997.

    Gouveia, L. e Pires, J.M, "Uma Análise Comparativa de Formulações para o Problema do Caixeiro Viajante", Investigação Operacional, Vol 16, pp 89-114, 1996.

    Gouveia, L., "Multicommodity Flow Models and Spanning Trees with Hop Constraints", European Journal of Operational Research, Vol 95, 178-190, 1996.

    Gouveia, L., "A Result on Projection for the Vehicle Routing Problem", European Journal of Operations Research, Vol 85, pp 610-624, 1995.

    Gouveia, L., "Using the Miller-Tucker-Zemlin Constraints to Formulate a Hop Constrained Minimal Spanning Tree Problem", Computers and Operations Research, Vol 22, pp 959-970, 1995.

    Gouveia, L.,"A 2n-constraint Formulation for the Capacitated Minimal Spanning Tree Problem", Operations Research, Vol 43, pp 130-141, 1995.

    Gouveia, L. e Vo S.,"A Classification of Formulations for the (Time-Dependent) Travelling Salesman Problem", European Journal of Operations Research, Vol 83, pp 69-82, 1995.

    Gouveia, L., "A Comparison of Directed Formulations for the Capacitated Minimal Spanning Tree Problem", Telecommunications Systems and Modelling, Vol 1, pp 51-76, 1993.

    Gouveia, L. e Paixão, J., "Dynamic Programming Based Heuristics for the Topological Design of Local Access Networks", Annals of Operations Research, Vol 33, pp 305-327, 1991.

Communications

Outras comunicações orais

More than 500 talks by submission in the following series of International meetings
(conferences where presentations were given only once are not included and below only a sample of the more important series is given):


International Network Optimization Conferences (INOC), organized by the European Network Optimization Group,

International Symposium on Mathematical Programming (ISMP)
Problem".

Optimization Days, organized alternatively by the Units CIRRELT e GERAD of Montreal. Montreal, 2007 (2)

Optimization (International conferences organized by Portuguese researchers, supervised by J. Judice and lat6ely by L. Nunes Vicente)

INFORMS Telecom, organized by the INFORMS Telecommunications Section

International Telecommunications Systems, organized by Prof. B. Gavish

INFORMS Annual Meeting, organized by the “Institute for Operations Research and the Management Sciences”.

EURO, organizada pela “Association of European Operational Research Societies”.

Comunicações orais por convite

About 25 talks by invitation.
This includes seminars, courses in PHd programs, plenary or semiplenary in conferences,