2006

• Implementations and empirical comparison for K shortest loopless path algorithms,
  M. Pascoal,
  The Ninth DIMACS Implementation Challenge: The Shortest Path Problem, November 2006

• A comprehensive survey on quickest path problems,
  M. Pascoal, M. E. Captivo and J. Clímaco,
  Annals of Operations Research, 147(1):5-21, October 2006

• An automated reference point-like approach for multicriteria shortest path problems,
  J. Clímaco, J. Craveirinha and M. Pascoal,
  Journal of Systems Science and Systems Engineering, 15(3):314-329, September 2006

2005

• An algorithm for ranking quickest simple paths,
  M. Pascoal, M. E. Captivo and J. Clímaco,
  Computers & Operations Research, 32(3):509-520, 2005

• An automatic reference point-like methodology for multicriteria shortest path problems,
  J. Clímaco, J. Craveirinha and M. Pascoal,
  Proceedings of the 6th International Symposium on Knowledge and Systems Sciences KSS'2005, Laxenburg, Austria, 31-40, August 2005

• Ranking optimal paths,
  M. Pascoal, M. E. Captivo and J. Clímaco,
  Proceedings of the International Network Optimization Conference INOC 2005, Lisboa, Portugal, B2.615-B2.621, March 2005

2004-1999

• Routing calculation in multimedia: A procedure based on a bicriteria model,
  J. Clímaco, J. Craveirinha and M. Pascoal,
  Proceedings of the European Congress on Computational Methods in Applied Sciences and Engineering ECCOMAS'04, Jyväskylä, Finland, July 2004

• Internet packet routing: application of a K-quickest path algorithm, J. Clímaco, M. Pascoal, J. Craveirinha and M. E. Captivo,
  Proceedings of the III International Conference on Decision Support for Telecommunications and Information Society DSTIS'03, Warsaw, Poland, 29-36, September 2003

• A note on a new variant of Murty's ranking assignments algorithm,
  M. Pascoal, M. E. Captivo and J. Clímaco,
  4OR - Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 1(3):243-254, 2003

• A bicriterion approach for routing problems in multimedia networks,
  J. Clímaco, J. Craveirinha and M. Pascoal,
  Networks, 41(4):206-220, 2003

• A new implementation of Yen's ranking loopless paths algorithm,
  E. Martins and M. Pascoal,
  4OR - Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 1(2):121-134, 2003

• An algorithm for calculating the K most reliable link disjoint paths with a maximum number of arcs,
  T. Gomes, J. Craveirinha, E. Martins, L. Martins and M. Pascoal,
  Proceedings of the 3rd International Workshop on Design of Reliable Communication Networks DRCN 2001, Budapest University of Technology and Economics, Hungary, 205-212, 2001

• An algorithm for calculating the K most reliable disjoint paths with a maximum number of arcs,
  T. Gomes, J. Craveirinha, E. Martins, L. Martins and M. Pascoal,
  Proceedings of the European Conference on Safety and Reliability ESREL'2001, Politectnico di Torino, Italy, 3:1659-1666, 2001

• A new improvement for a K shortest paths algorithm,
  E. Martins, M. Pascoal and J. Santos,
  Investigação Operacional, 21:47-60, 2001

• A enumeração dos K trajectos mais curtos,
  M. Pascoal,
  Investigação Operacional, 20:63-85, 2000

• Deviation algorithms for ranking shortest paths,
  E. Martins, M. Pascoal and J. Santos,
  International Journal of Foundations of Computer Science, 10(3):247-263, 1999

• The optimal path problem,
  E. Martins, M. Pascoal D. Rasteiro and J. Santos,
  Investigação Operacional, 19:43-60, 1999

Research Reports

• Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios,
  M. Pascoal and M. Resende, Technical Report nº 10 / 2014, INESC-Coimbra

• Minmax regret robust shortest path problem in a finite multi-scenario model,
  M. Pascoal and M. Resende, Technical Report nº 6 / 2014, INESC-Coimbra

• A new method to determine unsupported solutions in multicriteria mixed integer linear programming: a reference point approach,
  J. Clímaco and M. Pascoal, Technical Report nº 3 / 2012, INESC-Coimbra

• Bicriteria path problem minimizing the cost and minimizing the number of labels,
  M. Pascoal, M. E. Captivo, J. Clímaco and A. Laranjeira, Technical Report nº 1 / 2011, INESC-Coimbra

• Multicriteria path and tree problems - Discussion on exact algorithms and applications,
  J. Clímaco and M. Pascoal, Technical Report nº 3 / 2010, INESC-Coimbra

• The pipeline and valve location problem,
  G. Laporte and M. Pascoal, Technical Report nº 2 / 2010, INESC-Coimbra

• Minimum cost path problems with relays,
  G. Laporte and M. Pascoal, Technical Report nº 6 / 2009, INESC-Coimbra

• Enhanced algorithms for tricriteria shortest path problems with two bottleneck objective functions,
  L. Pinto and M. Pascoal, Technical Report nº 3 / 2009, INESC-Coimbra

• Labeling algorithms for minimum-hop bicriteria path problems,
  M. Pascoal, Technical Report nº 15 / 2008, INESC-Coimbra

• On the bicriterion - minimum cost/minimum label - spanning tree problem,
  J. Clímaco, M. E. Captivo and M. Pascoal, Technical Report nº 12 / 2008, INESC-Coimbra

• A mixed integer linear formulation for the minimum label spanning tree problem,
  M. E. Captivo, J. Clímaco and M. Pascoal, Technical Report nº 11 / 2008, INESC-Coimbra

• Finding non-dominated shortest pairs of disjoint simple paths - a revised version,
  J. Clímaco and M. Pascoal, Technical Report nº 10 / 2008, INESC-Coimbra

• Some computational improvements on finding the K shortest spanning trees,
  J. Clímaco, M. Pascoal and C. Silva, Technical Report nº 7 / 2008, INESC-Coimbra

• Finding non-dominated shortest pairs of disjoint simple paths,
  J. Clímaco and M. Pascoal, Technical Report nº 3 / 2007, INESC-Coimbra

• Implementations and empirical comparison of K shortest loopless path algorithms,
  M. Pascoal, Technical Report nº 9 / 2006, INESC-Coimbra

• An automatic reference point-like approach for dealing with a multicriteria teletraffic routing model,
  J. Clímaco, J. Craveirinha and M. Pascoal, Technical Report nº 7 / 2005, INESC-Coimbra

• A comprehensive survey on the quickest path problem,
  M. Pascoal, M. E. Captivo and J. Clímaco, Working Paper nº 15 / 2004, CIO

• A new implementation of Yen's ranking loopless paths algorithm,
  E. Martins and M. Pascoal, Technical Report 01/003, CISUC

• An algorithm for ranking optimal paths,
  E. Martins and M. Pascoal, Technical Report 01/002, CISUC

• An algorithm for calculating the K most reliable disjoint paths with a maximum number of arcs,
  T. Gomes, J. Craveirinha, E. Martins, L. Martins and M. Pascoal, Technical Report ET-N9, INESC-Coimbra, 2001

• Labeling algorithms for ranking shortest paths,
  E. Martins, M. Pascoal and J. Santos, Technical Report 00/001, CISUC

• An algorithm for ranking loopless paths,
  E. Martins, M. Pascoal and J. Santos, Technical Report 99/007, CISUC

• A new improvement for a K shortest paths algorithm,
  E. Martins, M. Pascoal and J. Santos, Technical Report 99/006, CISUC

• The K shortest loopless paths problem,
  E. Martins, M. Pascoal and J. Santos, CISUC, 1998

• The K shortest paths problem,
  E. Martins, M. Pascoal and J. Santos, CISUC, 1998

• A new algorithm for ranking loopless paths,
  E. Martins, M. Pascoal and J. Santos, CISUC, 1997

Communications

• Finding bicriteria shortest pairs of disjoint paths: related problems and algorithms,
  M. Pascoal, M. E. Captivo and J. Clímaco
  Recent advances in multi-objective optimization, Vienna, Austria, September 2014

• Computing pairs of disjoint paths by order of cost,
  M. Pascoal,
  IFORS 2014, Barcelona, Spain, July 2014

• Shortest paths on indoor localization,
  C. Santos and M. Pascoal,
  IFORS 2014, Barcelona, Spain, July 2014

• Computing pairs of disjoint paths by order of cost,
  M. Pascoal,
  Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, Portugal, May 2014

• Algorithms for the min-max regret robust shortest path problem in a finite multi-scenario model,
  M. Resende and M. Pascoal ,
  International Symposium on Combinatorial Optimization, Lisbon, Portugal, March 2014

• Min-max regret robust shortest path problem in a finite mult-scenario model,
  M. Pascoal and M. Resende,
  International Conference and Advanced School Planet Earth, Dynamics, Games and Science II, Lisbon, Portugal, September 2013

• Constructing minimal cost/minimal SRLG spanning trees over optical networks - An exact approach,
  J. Craveirinha, J. Clímaco, L. Martins, and M. Pascoal,
  International Conference on Telecommunication Systems Management, Prague, Czech Republic, May 2013

• Path based method for multicriteria metro location,
  M. Pascoal and G. Laporte,
  COA.pt 2012, The paths of combinatorial optimization applications in Portugal, Sabrosa, Portugal, September 2012

• Path based method for multicriteria metro location,
  M. Pascoal and G. Laporte,
  21st International Symposium on Mathematical Programming, Berlin, Germany, August 2012

• Informação imprecisa na forma de conjuntos aproximativos - aplicação a otimização em redes,
  M. Pascoal and M. Resende,
  ENSPM 2012, Faro, Portugal, July 2012

• A new method to determine unsupported non-dominated solutions in multicriteria integer linear programming - a reference point approach,
  M. Pascoal and J. Clímaco,
  CORS/MOPGP 2012, Niagara Falls, Canada, June 2012

• Combinatorial optimization problems with a cost and several bottleneck objectives: Algorithm and reoptimization,
  M. Pascoal, C. Bornstein, N. Maculan and L. Pinto,
  Optimization 2011, Caparica, Portugal, July 2011

• Comparing the bicriteria path and tree problems involving cost versus number of labels minimization,
  J. Clímaco, M. E. Captivo and M. Pascoal,
  IFORS 2011, Melbourne, Australia, July 2011

• Finding paths with minimal cost and minimal number of labels,
  M. Pascoal, M. E. Captivo, J. Clímaco and A. Laranjeira,
  NOW 2010, Ajaccio, France, August 2010

• The pipeline and valve location problem,
  M. Pascoal and G. Laporte,
  EURO 2010, Lisbon, Portugal, July 2010

• Minimum cost path problems with relays,
  M. Pascoal and G. Laporte,
  ALIO/INFORMS 2010, Buenos Aires, Argentina, June 2010

• New labeling algorithms for minimum-hop bicriteria path problems,
  M. Pascoal,
  EURO 2009, Bonn, Germany, July 2009

• On the bicriterion - minimum cost/minimum label - spanning tree problem,
  J. Clímaco, M. E. Captivo and M. Pascoal,
  EURO 2009, Bonn, Germany, July 2009

• A mixed integer linear formulation for the minimum label spanning tree problem,
  M. E. Captivo, J. Clímaco and M. Pascoal,
  EURO 2009, Bonn, Germany, July 2009

• Multicriteria approaches for a routing problem in multimedia networks,
  M. Pascoal,
  Centre Interuniversitaire de Recherche sur les Réseaux d'Entreprise, la Logistique et le Transport, University of Montréal, November 2008

• Do caminho mais curto ao caminho mais curto por unidade de tempo,
  M. Pascoal,
  Encontro da SPM 2008, Coimbra, June 2008

• Árvores, caminhos e cores,
  M. Pascoal, M. E. Captivo and J. Clímaco,
  IO'2008, Vila Real, March 2008

• Finding non-dominated shortest pairs of disjoint simple paths,
  M. Pascoal and J. Clímaco,
  Optimization 2007, Porto, July 2007

• Traffic splitting in MPLS networks - a hierarchical multicriteria approach,
  J. Craveirinha, J. Clímaco, M. Pascoal and L. Martins,
  DSTIS'2007, Warsaw, Poland, July 2007

• A hybrid deviation algorithm for ranking K shortest simple paths,
  M. Pascoal,
  EURO 2007, Prague, Czech Republic, July 2007

• An algorithm for a bicriterion - minimum cost / minimum label - spanning tree problem,
  M. Pascoal, M. E. Captivo e J. Clímaco,
  Iberian Conference in Optimization, Coimbra, November 2006

• Implementations and empirical comparison for K shortest loopless path algorithms,
  M. Pascoal,
  The Ninth DIMACS Implementation Challenge: The Shortest Path Problem, Piscataway, NJ, United States of America, November 2006

• An algorithm for a bicriterion - minimum cost/minimum label - spanning tree problem,
  M. Pascoal, M. E. Captivo e J. Clímaco,
  EURO 2006, Reykjavík, Iceland, July 2006

• A hierarchical multicriteria routing model in multimedia networks,
  J. Clímaco, J. Craveirinha e M. Pascoal,
  EURO 2006, Reykjavík, Iceland, July 2006

• A lazy version of a K quickest simple path ranking algorithm,
  M. Pascoal, M. E. Captivo e J. Clímaco,
  ALIO/EURO 2005, Paris, France, October 2005

• Uma metodologia automática do tipo ponto de referência para problemas do trajecto mais curto multicritério,
  M. Pascoal, J. Clímaco and J. Craveirinha,
  AIORT 2005, Coimbra, September 2005

• An automatic reference point-like methodology for multicriteria shortest path problems based on a bicriteria model,
  J. Clímaco, J. Craveirinha and M. Pascoal,
  CSM/KSS'2005, Laxenburg, Austria, August 2005

• Ranking optimal paths,
  M. Pascoal, M. E. Captivo and J. Clímaco,
  INOC 2005, Lisboa, March 2005

• Routing calculation in multimedia: A procedure based on a bicriteria model,
  J. Clímaco, J. Craveirinha and M. Pascoal,
  MMTN 2004, Coimbra, September 2004

• Quickest path algorithms and an application to Internet packet routing,
  M. Pascoal, M. E. Captivo, J. Clímaco and J. Craveirinha,
  AIRO 2004, Lecce, Italy, September 2004

• An algorithm for ranking quickest simple paths,
  J. Clímaco, M. Pascoal and M. E. Captivo,
  Optimization 2004, Lisboa, July 2004

• Routing calculation in multimedia: A procedure based on a bicriteria model,
  J. Clímaco, J. Craveirinha, M. Pascoal,
  ECCOMAS 2004, Jyväskylä, Finland, July 2004

• Aplicação de um algoritmo para os K caminhos mais rápidos ao encaminhamento de dados na Internet,
  M. Pascoal, J. Clímaco, J. Craveirinha and M. E. Captivo,
  IO'2004, Porto, March 2004

• Internet packet routing: application of a K-quickest path algorithm,
  J. Clímaco, J. Craveirinha, M. Pascoal and M. E. Captivo,
  DSTIS'2003, Warsaw, Poland, September 2003

• A note on a new variant of Murty's ranking assignments algorithm,
  M. Pascoal, M. E. Captivo and J. Clímaco,
  IFORS'2002, Edimburgh, July 2002

• A bicriterion approach for routing problems in multimedia networks,
  J. Clímaco, J. Craveirinha and M. Pascoal,
  CSM'2002, Laxenburg, Austria, July 2002

• Um algoritmo para as K afectações de menor custo,
  M. Pascoal, M. E. Captivo and J. Clímaco,
  IO'2002, Guimarães, March 2002

• An algorithm for calculating the K most reliable link disjoint paths with a maximum number of arcs,
  T. Gomes, J. Craveirinha, E. Martins, L. Martins and M. Pascoal,
  3rd International Workshop on Design of Reliable Communication Networks DRCN 2001, Hungary, 2001

• An algorithm for calculating the K most reliable disjoint paths with a maximum number of arcs,
  T. Gomes, J. Craveirinha, E. Martins, L. Martins and M. Pascoal,
  European Conference on Safety and Reliability ESREL'2001, Italy, September 2001

• A new implementation of Yen's ranking loopless paths algorithm,
  E. Martins and M. Pascoal,
  Optimization 2001, Aveiro, July 2001

• The K shortest paths problem - a survey,
  E. Martins and M. Pascoal,
  X CLAIO, México, September 2000

• Algoritmos dos desvios para a enumeração dos K trajectos mais curtos,
  M. Pascoal,
  IO'2000, Setúbal, April 2000

• Um novo melhoramento de um algoritmo para o problema dos K trajectos mais curtos,
  M. Pascoal and J. Santos,
  IO'2000, Setúbal, April 2000

• Computational experiments with K shortest paths algorithms,
  E. Martins, M. Pascoal and J. Santos,
  IFORS'99, Beijing, August 1999

• Optimização em redes,
  M. Pascoal, D. Rasteiro and J. Santos, University of Minho, 1999
  

  - Optimização em redes - Uma visão global

  - O problema dos K trajectos mais curtos e o problema dos K caminhos mais curtos

  - O problema do trajecto mais curto segundo vários critérios

  
  

Editorial activity

• RAIRO - Operations Research, Associate editor (2012-)
  
  

Meetings

• IO 2022 - XXII Congresso da Associação Portuguesa de Investigação Operacional
  
• Workshop on Robust Optimisation
  
• Optimization 2020
  
• IO 2019 - XX Congresso da Associação Portuguesa de Investigação Operacional
  
• Optimization 2017
  
• 8.º Campeonato Nacional de Jogos Matemáticos
  
• Bridges 2011
  
• IO 2011 - XV Congresso da Associação Portuguesa de Investigação Operacional