Pascoal, Marta
Claim profile

Credit Name
Pascoal, Marta
Name
Pascoal, Marta Margarida Braz
Variants
Pascoal, Marta M. B.
Main Affiliation
Unidade de I&D
Scopus Author ID
Researcher ID
Status
UC Researcher

Publications
(All)
Date issued
Type
Fulltext
Results 1-33 of 33 (Search time: 1.142 seconds).
Issue Date | Title | Author(s) | Type | Access | |
---|---|---|---|---|---|
1 | 2005 | An algorithm for ranking quickest simple paths | Pascoal, Marta M. B. ; Captivo, M. Eugénia V. ; Clímaco, João C. N. | article | openAccess |
2 | 2017 | Algorithms for determining a node-disjoint path pair visiting specified nodes | Gomes, Teresa ; Martins, Lúcia ; Ferreira, Sofia ; Pascoal, Marta ; Tipper, David | article | embargoedAccess |
3 | 1997 | Algoritmos para a enumeração dos K trajectos mais curtos | Pascoal, Marta Margarida Braz | masterThesis | openAccess |
4 | 2016 | An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs | Clímaco, João C. N. ; Pascoal, Marta | article | embargoedAccess |
5 | 2015 | An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks | Craveirinha, José M. F. ; Clímaco, João C. N. ; Martins, Lúcia M. R. A. ; Pascoal, Marta | article | embargoedAccess |
6 | 25-Sep-2019 | Aplicação de métodos biobjetivo a otimização linear fracionária | Duarte, Luís Henrique Rodrigues | masterThesis | openAccess |
7 | 2006 | An automated reference point-like approach for multicriteria shortest path problems | Clímaco, João ; Craveirinha, José ; Pascoal, Marta | article | openAccess |
8 | 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 |
9 | 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 |
10 | 2020 | Bimaterial 3D printing using galvanometer scanners | Bandeira, Daniel ; Pascoal, Marta ; Santos, Beatriz | article | embargoedAccess |
11 | 1-Jul-2014 | Caminhos mais curtos em localização em espaços fechados | Santos, Cátia Alexandra Alves | masterThesis | openAccess |
12 | 3-Jun-2015 | Cálculo de soluções eficientes do problema de carpooling biobjetivo | Sousa, Teresa de Jesus Romão Figueira de | masterThesis | openAccess |
13 | 2013 | Combining multicriteria analysis and tabu search for dial-a-ride problems | Paquette, Julie ; Cordeau, Jean-François ; Laporte, Gilbert ; Pascoal, Marta | article | embargoedAccess |
14 | 2006 | A comprehensive survey on the quickest path problem | Pascoal, Marta ; Captivo, M. ; Clímaco, João | article | openAccess |
15 | 24-Jul-2018 | Computational methods for beam angle optimization in intensity modulated radiotherapy | Valente, Rui Guilherme da Silva | masterThesis | openAccess |
16 | 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 |
17 | 2016 | Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios | Pascoal, Marta ; Resende, Marisa | article | embargoedAccess |
18 | 1-Apr-2005 | Enumeração de soluções em problemas de optimização em redes | Pascoal, Marta Margarida Braz | doctoralThesis | embargoedAccess |
19 | 23-Jul-2021 | Estudo comparativo de portefólios de investimento no mercado acionista | Ramos, Fátima Antunes | masterThesis | openAccess |
20 | 17-May-2021 | Finding dissimilar paths: formulations and variants | Dehkharghani, Ali Moghanni | doctoralThesis | embargoedAccess |
21 | 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 |
22 | 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 |
23 | 2003 | A new implementation of Yen’s ranking loopless paths algorithm | Martins, Ernesto Q. V. ; Pascoal, Marta M. B. | article | openAccess |
24 | 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 |
25 | 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 |
26 | 2020 | On a relaxed maximally disjoint path pair problem: A bicriteria approach | Pascoal, Marta ; Clímaco, João | article | embargoedAccess |
27 | 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 |
28 | 13-Jun-2017 | Otimização de um sistema de impressão tridimensional bimaterial | Bandeira, Daniel Filipe Almeida | masterThesis | openAccess |
29 | 2015 | Path based algorithms for metro network design | Laporte, Gilbert ; Pascoal, Marta | article | embargoedAccess |
30 | 20-Feb-2018 | Um problema de otimização de rotas com janelas temporais | Mesquita, Micael Mateus | masterThesis | openAccess |
31 | 22-Mar-2017 | Seleção de Carteiras: Abordagem Biobjetivo de Modelos Lineares | Lopes, Carolina Gama Mendes | masterThesis | closedAccess |
32 | 2014 | The minmax regret robust shortest path problem in a finite multi-scenario model | Pascoal, Marta ; Resende, Marisa | article | embargoedAccess |
33 | 10-Jul-2015 | The robust shortest path problem with discrete data | Resende, Marisa Cristina Marquês Neto de Matos | doctoralThesis | embargoedAccess |