• Marta Pascoal

  • Research Area


  • Institution

    University of Coimbra

  • PhD

    Institution: University of Coimbra
    Year: 2005

  • Main research publications

    • Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios (with M. Resende) , Discrete Optimization, 22 (2016)
    • Combining multi-criteria analysis and tabu search to solve real-life dial-a-ride problems (with J. Paquette, J.-F. Cordeau, G. Laporte) , Transportation Research Part B 52 (2013)
    • Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: an algorithm with reoptimization (with C. Bornstein, N. Maculan, L. Pinto) , Computers & Operations Research 39 (2012)
    • On the bicriterion - minimal cost/minimal label - spanning tree problem (with J. Clímaco, M. E. Captivo) , European Journal of Operational Research 204 (2010)
    • A new implementation of Yen's ranking loopless paths algorithm (with E. Martins) , 4OR - Quarterly Journal of the Belgian, French and Italian Operations Research S ocieties 1 (2003)
  • PhD Students

    • Ali Moghanni ongoing
    • Marisa Resende The robust shortest path problem with discrete data 2015
  • Adittional information

    2012- : Associate editor of RAIRO - Operations Research.

Research and Events


More Events

Defended Theses

  • Structure, algorithmics and dynamics of endomorphisms for certain classes of groups
      André da Cruz Carvalho (April 2023)
      Pedro V. Silva
  • A point-free study of z-embeddings, more general classes of localic maps, and uniform continuity
      Ana Belén Avilez García (April 2023)
      Jorge Picado
  • Analysis of equations of motion of inextensible strings and networks
      Ayk Telciyan (April 2023)
      Dmitry Vorotnikov
More Theses