Short bio

Marta Pascoal obtained her BSc in Mathematics-Computer Science and MSc in Mathematics-Applied Mathematics from the University of Coimbra in 1996 and 1998, respectively. She completed the PhD in Mathematics-Applied Mathematics from the same university in 2005.

From 2021 she is Associate Professor in the Operations Research and Discrete Optimization group of the Department of Electronics, Information and Bioengineering of the Politecnico di Milano. She is also a collaborator researcher of the Centre for Mathematics of the University of Coimbra and of the Institute for Systems Engineering and Computers at Coimbra. She was Assistant Professor and Associate Professor at the Department of Mathematics of the University of Coimbra from 2005 to 2025.

Her main research interests are in discrete and network optimization, and in multiobjective optimization; with focus on designing exact algorithms for problems in those contexts. Her research has addressed application models in the fields of telecommunication networks, transportation and energy management optimization.

Publications [go to top]

Journal publications

• Multiobjective Path Problems and Algorithms in Telecommunication Network Design Overview and Trends, J. Craveirinha, J. Clímaco, R. Girão-Silva and M. Pascoal, Algorithms, 17(6):222, 2024

• Optimizing the integration of express bus services with micro-mobility: a case study, M. Candiani, F. Malucelli, M. Pascoal, and T. Schettini, In Transportation Research Procedia, 78:289-296, 2024

• An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks, J. Craveirinha, M. Pascoal and J. Clímaco, INFOR: Information Systems and Operational Research, 61:399-418, 2023

• Finding K dissimilar paths: single-commodity and discretized flow formulations, A. Moghanni, M. Pascoal and M. T. Godinho, Computers and Operations Research, 147:105939, 2022

• An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks, M. Pascoal, J. Craveirinha and J. Clímaco, TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, 30:405-425, 2022

• Finding K shortest and dissimilar paths, A. Moghanni, M. Pascoal and M. T. Godinho, International Transactions in Operational Research, 29:1573-1601, 2022

• On a relaxed maximally disjoint path pair problem: A bicriteria approach, M. Pascoal and J. Clímaco, International Transactions in Operational Research, 27:2045-2063, 2020

• Bimaterial 3D printing using galvanometer scanners, D. Bandeira, M. Pascoal and B. Santos, Optimization and Engineering, 21(1), 49-72, 2020

• Algorithms for determining a node-disjoint path pair visiting specified nodes, T. Gomes, L. Martins, S. Marques, M. Pascoal and D. Tipper, Optical Switching and Networking, 23(Part 2):189-204, January 2017

• An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs, J. Clímaco and M. Pascoal, INFOR: Information Systems and Operational Research, 54:317-343, 2016

• Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios, M. Pascoal and M. Resende, Discrete Optimization, 22:122-140, 2016

• An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks, J. Craveirinha, J. Clímaco, L. Martins and M. Pascoal, Telecommunication Systems, 62:327-346, 2016

• Path based algorithms for metro network design, G. Laporte and M. Pascoal, Computers & Operations Research, 62:78-94, 2015

• The minmax regret robust shortest path problem in a finite multi-scenario model, M. Pascoal and M. Resende, Applied Mathematics and Computation, 241:88-111, 2014

• Bicriteria path problem minimizing the cost and minimizing the number of labels, M. Pascoal, M. E. Captivo, J. Clímaco and A. Laranjeira, 4OR - Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 11(3):275-294, 2013

• Combining multi-criteria analysis and tabu search to solve real-life dial-a-ride problems, J. Paquette, J.-F. Cordeau, G. Laporte and M. Pascoal, Transportation Research Part B, 52:1-15, 2013

• Enumerating K Best Paths in Order of Length in DAGs, M. Pascoal and A. Sedeño-Noda, European Journal of Operational Research, 221(2):308-316, 2012

• The pipeline and valve location problem, G. Laporte and M. Pascoal, European Journal of Industrial Engineering, 6(3):301-321, 2012

• Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization, C. Bornstein, N. Maculan, M. Pascoal and L. Pinto, Computers & Operations Research, 39(9):1969-1976, 2012

• Multicriteria path and tree problems - Discussion on exact algorithms and applications, J. Clímaco and M. Pascoal, International Transactions in Operations Research, 19(1-2):63-98, 2012

• Minimum cost path problems with relays, G. Laporte and M. Pascoal, Computers & Operations Research, 38(1):165-173, 2011

• Optimizing the profit from a complex cascade of hydroelectric stations with recirculating water, A. Korobeinikov, A. Kovacec, M. McGuinness, M. Pascoal, A. Pereira and S. Vilela, Mathematics-in-Industry Case Studies Journal, 2:111-133, 2010

• On algorithms for the tricriteria shortest path problem with two bottleneck objective functions, L. Pinto and M. Pascoal, Computers & Operations Research, 37(10):1774-1779, 2010

• On the bicriterion - minimal cost/minimal label - spanning tree problem, J. Clímaco, M. E. Captivo and M. Pascoal, European Journal of Operational Research, 204(2):199-205, 2010

• A mixed integer linear formulation for the minimum label spanning tree problem, M. E. Captivo, J. Clímaco and M. Pascoal, Computers & Operations Research, 36(11):3082-3085, 2009

• Finding non-dominated bicriteria shortest pairs of disjoint simple paths, J. Clímaco and M. Pascoal, Computers & Operations Research, 36(11):2892-2898, 2009

• Traffic splitting in MPLS networks - a hierarchical multicriteria approach, J. Clímaco, J. Craveirinha, M. Pascoal and L. Martins, Journal of Telecommunications and Information Technology, 4:3-10, 2007

• Computational experiments with a lazy version of a K quickest simple path ranking algorithm, M. Pascoal, M. E. Captivo and J. Clímaco, TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, 15(2):372-382, 2007

• Internet packet routing: application of a K-quickest path algorithm, J. Clímaco, M. Pascoal, J. Craveirinha and M. E. Captivo, European Journal of Operational Research, 181(3):1045-1054, 2007

• 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

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

• 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

• 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

Conference proceedings

• Bimaterial three-dimensional printing using Digital Light Processing projectors, D. Bandeira and M. Pascoal, In Operational Research: IO 2022, Évora, Portugal, November 6 8, 139-155, Springer Proceedings in Mathematics & Statistics, 2023

• Implementation of geographic diversity in resilient telecommunication networks, M. T. Godinho and M. Pascoal, In Operational Research: IO 2022, Évora, Portugal, November 6 8, 89-98, Springer Proceedings in Mathematics & Statistics, 2023

• New models for finding K short and dissimilar paths, M. Pascoal, A. Moghanni and M. T. Godinho, In Operational Research: IO 2021, Figueira da Foz, Portugal, November 7 9, pages 143-161, Springer Proceedings in Mathematics & Statistics, 2023

• The electric vehicle shortest path problem with time windows and prize collection, A. Cassia, O. Jabali, F. Malucelli, and M. Pascoal, In S. Fidanova, A. Mucherino, and D. Zaharie, editors, 17th Conference on Computer Science and Intelligence Systems, (FedCSIS), Sofia, Bulgaria, pages 313-322, IEEE

• The rough interval shortest path problem, A. Moghanni and M. Pascoal, In Operational Research: IO 2019, Tomar, Portugal, July 22 24, pages 53-64, Springer Proceedings in Mathematics & Statistics, 2021

• Protected shortest path visiting specified nodes, T. Gomes, S. Marques, L. Martins, M. Pascoal and D. Tipper, Proceedings of the RNDM 15 - 7th International Workshop on Reliable Networks Design and Modeling, IEEE - German Section, pp. 120-127, October 2015

• Constructing minimal cost/minimal SRLG spanning trees Over optical networks - An exact approach, J. Clímaco, J. Craveirinha, L. Martins and M. Pascoal, Proceedings of the 2013 International Conference on Telecommunication Systems Modeling and Analysis, Czech Technical University in Prague, May 2013

• A stochastic bicriteria approach for restorable QoS routing in MPLS, J. Clímaco, J. Craveirinha, T. Gomes and M. Pascoal, Proceedings of the 2011 International Conference on Telecommunication Systems, Czech Technical University in Prague, May 2011

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

• 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

• 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

• 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, Politecnico di Torino, Italy, 3:1659-1666, 2001

Book chapters

• The MinSum-MinHop and the MaxMin-MinHop bicriteria path problems, M. Pascoal, In A. Adamatzky, editor, Shortest Path Solvers. From Software to Wetware, volume 32 of Emergence, Complexity and Computation, pages 73-97, Springer, Cham, 2018

• Reducing the minmax regret robust shortest path problem with finite multi-scenarios, M. Pascoal and M. Resende, In J.-P. Bourguignon, R. Jeltsch, A. Pinto, and M. Viana, editors, Mathematics of Energy and Climate Change: International Conference and Advanced School Planet Earth, Portugal, March 21-28, 2013, volume 2 of CIM Series in Mathematical Sciences: Dynamics, Games and Science III, pages 247-262, Springer-Verlag, 2015

• Modeling bimaterial 3D printing using galvanometer scanners, D. Bandeira and M. Pascoal, In I. Farag, F. Izsák, and P. Simon, editors, Progress in Industrial Mathematics at ECMI 2018, pages 27-35, Springer-Verlag, 2019

• Multicriteria routing models in telecommunication networks - overview and a case study, J. Clímaco, J. Craveirinha and M. Pascoal, In Advances in Multiple Criteria Decision Making and Human Systems Management, Y. Shi, D. L. Olson, A. Stam (Editors), 17-46, IOS Press, 2007

Teaching [go to top]

• 2021-2025: Foundations of Operations Research, MSc in Computer Science and Telecommunications Engineering, 1st semester, PoliMI, campus Leonardo

• 2024/2025: Numerical Methods for Optimization, MSc in Energy Engineering, 1st semester, PoliMI, campus Piacenza

• 2023-2024: Fondamenti di Ricerca Operativa, BSc in Automation Engineering, 2nd semester, PoliMI, campus Leonardo [Exercises]

• 2023/2024: Fondamenti di Ricerca, BSc in Mathematical Engineering, 1st semester, PoliMI, campus Leonardo [Laboratories]

• 2021-2024: Graph Optimization, MSc in Telecommunications Engineering, 2nd semester, PoliMI, campus Leonardo [Exercises, Laboratories]

• 2021-2024: Optimization, MSc in Mathematical Engineering, 2nd semester, PoliMI, campus Leonardo [Exercises]