Deviation Algorithms for Ranking Shortest Paths. - Ernesto de Queirós Vieira Martins; Marta M. B. Pascoal; José Luis E. Dos Santos (Int. J. Found. Comput. Sci., 1999)

An Algorithm for Calculating the k Most Reliable Link Disjoint Paths with a Maximum Number of Arcs in Each Path. - Teresa Gomes; José M. F. Craveirinha; Lúcia Martins; Marta Pascoal (DRCN, 2001)

A new implementation of Yen's ranking loopless paths algorithm. - Ernesto de Queirós Vieira Martins; Marta M. B. Pascoal (4OR, 2003)

A note on a new variant of Murty's ranking assignments algorithm. - Marta M. B. Pascoal; M. Eugénia V. Captivo; João C. N. Clímaco (4OR, 2003)

A bicriterion approach for routing problems in multimedia networks. - João C. N. Clímaco; José M. F. Craveirinha; Marta M. B. Pascoal (Networks, 2003)

An algorithm for ranking quickest simple paths. - Marta M. B. Pascoal; M. Eugénia V. Captivo; João C. N. Clímaco (Comput. Oper. Res., 2005)

A comprehensive survey on the quickest path problem. - Marta M. B. Pascoal; M. Eugénia V. Captivo; João C. N. Clímaco (Ann. Oper. Res., 2006)

Internet packet routing: Application of a K. - João C. N. Clímaco; Marta M. B. Pascoal; José M. F. Craveirinha; M. Eugénia V. Captivo (Eur. J. Oper. Res., 2007)

Experiential Learning in Science: Getting the Laboratory Inside the Classroom Using the Web. - Ana Maria de Almeida 002; João Fernandes 003; Marta Pascoal; Susana Pereira (ICALT, 2009)

A mixed integer linear formulation for the minimum label spanning tree problem. - M. Eugénia V. Captivo; João C. N. Clímaco; Marta M. B. Pascoal (Comput. Oper. Res., 2009)

Finding non-dominated bicriteria shortest pairs of disjoint simple paths. - João C. N. Clímaco; Marta M. B. Pascoal (Comput. Oper. Res., 2009)

On algorithms for the tricriteria shortest path problem with two bottleneck objective functions. - Leizer de Lima Pinto; Marta M. B. Pascoal (Comput. Oper. Res., 2010)

On the bicriterion - minimal cost/minimal label - spanning tree problem. - João C. N. Clímaco; M. Eugénia V. Captivo; Marta M. B. Pascoal (Eur. J. Oper. Res., 2010)

Minimum cost path problems with relays. - Gilbert Laporte; Marta M. B. Pascoal (Comput. Oper. Res., 2011)

Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization. - Claudio T. Bornstein; Nelson Maculan; Marta Pascoal; Leizer de Lima Pinto (Comput. Oper. Res., 2012)

Enumerating K best paths in length order in DAGs. - Marta M. B. Pascoal; Antonio Sedeño-Noda (Eur. J. Oper. Res., 2012)

Multicriteria path and tree problems: discussion on exact algorithms and applications. - João C. N. Clímaco; Marta M. B. Pascoal (Int. Trans. Oper. Res., 2012)

Bicriteria path problem minimizing the cost and minimizing the number of labels. - Marta M. B. Pascoal; M. Eugénia V. Captivo; João C. N. Clímaco; Ana Laranjeira (4OR, 2013)

The minmax regret robust shortest path problem in a finite multi-scenario model. - Marta M. B. Pascoal; Marisa Resende (Appl. Math. Comput., 2014)

Protected shortest path visiting specified nodes. - Teresa Gomes; Sofia Marques; Lúcia Martins; Marta Pascoal; David Tipper (RNDM@WMNC, 2015)

Path based algorithms for metro network design. - Gilbert Laporte; Marta M. B. Pascoal (Comput. Oper. Res., 2015)

Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios. - Marta M. B. Pascoal; Marisa Resende (Discret. Optim., 2016)

An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs. - João C. N. Clímaco; Marta M. B. Pascoal (INFOR Inf. Syst. Oper. Res., 2016)

An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks. - José M. F. Craveirinha; João C. N. Clímaco; Lúcia M. R. A. Martins; Marta M. B. Pascoal (Telecommun. Syst., 2016)

Algorithms for determining a node-disjoint path pair visiting specified nodes. - Teresa Gomes; Lúcia Martins; Sofia Ferreira; Marta Pascoal; David Tipper (Opt. Switch. Netw., 2017)

On a relaxed maximally disjoint path pair problem: a bicriteria approach. - Marta M. B. Pascoal; João C. N. Clímaco (Int. Trans. Oper. Res., 2020)

The electric vehicle shortest path problem with time windows and prize collection. - Antonio Cassia; Ola Jabali; Federico Malucelli; Marta Pascoal (FedCSIS, 2022)

Finding K dissimilar paths: Single-commodity and discretized flow formulations. - Ali Moghanni; Marta Pascoal; Maria Teresa Godinho (Comput. Oper. Res., 2022)

Finding shortest and dissimilar paths. - Ali Moghanni; Marta Pascoal; Maria Teresa Godinho (Int. Trans. Oper. Res., 2022)

Inclusion Through Accessibility. Handi Bot, a Translator for Portuguese Sign Language. - Sónia Rafael; Francisco Rebelo; Beatriz Pinto; Andreia Gil; Catharina Lima; Joana Chitas; Marta Pascoal; Lúcio Simões (HCI (10), 2023)

An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks. - José M. F. Craveirinha; Marta Pascoal; João C. N. Clímaco (INFOR Inf. Syst. Oper. Res., 2023)

Multiobjective Path Problems and Algorithms in Telecommunication Network Design - Overview and Trends. - José M. F. Craveirinha; João C. N. Clímaco; Rita Girão-Silva; Marta Pascoal (Algorithms, 2024)