Pascoal, Marta
Claim profile
Loading...
2
0
20
0
false
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
Loading...
3
0
20
0
false
Publications
(All)
Date issued
Type
Fulltext
Results 1-23 of 23 (Search time: 0.028 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 | 2006 | An automated reference point-like approach for multicriteria shortest path problems | Clímaco, João ; Craveirinha, José ; Pascoal, Marta | article | openAccess |
| 7 | 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 |
| 8 | 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 |
| 9 | 2020 | Bimaterial 3D printing using galvanometer scanners | Bandeira, Daniel ; Pascoal, Marta ; Santos, Beatriz | article | embargoedAccess |
| 10 | 2013 | Combining multicriteria analysis and tabu search for dial-a-ride problems | Paquette, Julie ; Cordeau, Jean-François ; Laporte, Gilbert ; Pascoal, Marta | article | embargoedAccess |
| 11 | 2006 | A comprehensive survey on the quickest path problem | Pascoal, Marta ; Captivo, M. ; Clímaco, João | article | openAccess |
| 12 | 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 |
| 13 | 2016 | Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios | Pascoal, Marta ; Resende, Marisa | article | embargoedAccess |
| 14 | 1-Apr-2005 | Enumeração de soluções em problemas de optimização em redes | Pascoal, Marta Margarida Braz | doctoralThesis | embargoedAccess |
| 15 | 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 |
| 16 | 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 |
| 17 | 2003 | A new implementation of Yen’s ranking loopless paths algorithm | Martins, Ernesto Q. V. ; Pascoal, Marta M. B. | article | openAccess |
| 18 | 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 |
| 19 | 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 |
| 20 | 2020 | On a relaxed maximally disjoint path pair problem: A bicriteria approach | Pascoal, Marta ; Clímaco, João | article | embargoedAccess |
| 21 | 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 |
| 22 | 2015 | Path based algorithms for metro network design | Laporte, Gilbert ; Pascoal, Marta | article | embargoedAccess |
| 23 | 2014 | The minmax regret robust shortest path problem in a finite multi-scenario model | Pascoal, Marta ; Resende, Marisa | article | embargoedAccess |