Pascoal, Marta
Full Name
Pascoal, Marta
Loading...
2
0
5
0
false
Loading...
3
0
5
0
false
Results 1-9 of 9 (Search time: 0.008 seconds).
| Issue Date | Title | Author(s) | Type | Access | |
|---|---|---|---|---|---|
| 1 | 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 |
| 2 | 2016 | An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs | Clímaco, João C. N. ; Pascoal, Marta | article | embargoedAccess |
| 3 | 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 |
| 4 | 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 |
| 5 | 2013 | Combining multicriteria analysis and tabu search for dial-a-ride problems | Paquette, Julie ; Cordeau, Jean-François ; Laporte, Gilbert ; Pascoal, Marta | article | embargoedAccess |
| 6 | 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 |
| 7 | 2016 | Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios | Pascoal, Marta ; Resende, Marisa | article | embargoedAccess |
| 8 | 2015 | Path based algorithms for metro network design | Laporte, Gilbert ; Pascoal, Marta | article | embargoedAccess |
| 9 | 2014 | The minmax regret robust shortest path problem in a finite multi-scenario model | Pascoal, Marta ; Resende, Marisa | article | embargoedAccess |