| Issue Date | Title | Author(s) | Type | Access |
| 2013 | Bicriteria path problem minimizing the cost and minimizing the number of labels | Pascoal, Marta ; Captivo, M. Eugénia ; Clímaco, João ; Laranjeira, Ana | article | embargoedAccess |
| 2003 | A bicriterion approach for routing problems in multimedia networks | Clímaco, João C. N. ; Craveirinha, José M. F. ; Pascoal, Marta M. B. | article | openAccess |
| 2020 | Bimaterial 3D printing using galvanometer scanners | Bandeira, Daniel ; Pascoal, Marta ; Santos, Beatriz | article | embargoedAccess |
| 1-Jul-2014 | Caminhos mais curtos em localização em espaços fechados | Santos, Cátia Alexandra Alves | masterThesis | openAccess |
| 3-Jun-2015 | Cálculo de soluções eficientes do problema de carpooling biobjetivo | Sousa, Teresa de Jesus Romão Figueira de | masterThesis | openAccess |
| 2013 | Combining multicriteria analysis and tabu search for dial-a-ride problems | Paquette, Julie ; Cordeau, Jean-François ; Laporte, Gilbert ; Pascoal, Marta | article | embargoedAccess |
| 2006 | A comprehensive survey on the quickest path problem | Pascoal, Marta ; Captivo, M. ; Clímaco, João | article | openAccess |
| 24-Jul-2018 | Computational methods for beam angle optimization in intensity modulated radiotherapy | Valente, Rui Guilherme da Silva | masterThesis | openAccess |
| 2013 | Constructing minimal cost/minimal SRLG spanning trees Over optical networks - An exact approach | Craveirinha, José ; Clímaco, João ; Martins, Lúcia ; Pascoal, Marta | article | openAccess |
| 2016 | Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios | Pascoal, Marta ; Resende, Marisa | article | embargoedAccess |
| 1-Apr-2005 | Enumeração de soluções em problemas de optimização em redes | Pascoal, Marta Margarida Braz | doctoralThesis | embargoedAccess |
| 23-Jul-2021 | Estudo comparativo de portefólios de investimento no mercado acionista | Ramos, Fátima Antunes | masterThesis | openAccess |
| 17-May-2021 | Finding dissimilar paths: formulations and variants | Dehkharghani, Ali Moghanni | doctoralThesis | embargoedAccess |
| 30-Apr-2009 | Finding non-dominated bicriteria shortest pairs of disjoint simple paths | Clímaco, João C. N. ; Pascoal, Marta M. B. | article | openAccess |
| 2007 | Internet packet routing: Application of a K-quickest path algorithm | Clímaco, João C. N. ; Pascoal, Marta M. B. ; Craveirinha, José M. F. ; Captivo, M. Eugénia V. | article | openAccess |
| 2003 | A new implementation of Yen’s ranking loopless paths algorithm | Martins, Ernesto Q. V. ; Pascoal, Marta M. B. | article | openAccess |
| 2001 | A new improvement for a K shortest paths algorithm | Martins, Ernesto de Queirós Vieira ; Pascoal, Marta Margarida Braz ; Santos, José Luís Esteves | article | openAccess |
| 2003 | A note on a new variant of Murty’s ranking assignments algorithm | Pascoal, Marta ; Captivo, M. Eugénia ; Clímaco, João | article | openAccess |
| 2020 | On a relaxed maximally disjoint path pair problem: A bicriteria approach | Pascoal, Marta ; Clímaco, João | article | embargoedAccess |
| 2010 | Optimizing the profit from a complex cascade of hydroelectric stations with recirculating water | Korobeinikov, Andrei ; Kovacec, Alexander ; McGuinness, Mark ; Pascoal, Marta ; Pereira, Ana; Vilela, Sónia | article | openAccess |
