Loading... 2 0 20 0 false
 
Credit Name
Pascoal, Marta
 
Name
Pascoal, Marta Margarida Braz
 
Variants
Pascoal, Marta M. B.
 
 
 
 
Scopus Author ID
 
Researcher ID
 
Status
UC Researcher
Loading... 3 0 20 0 false

Publications
(All)

Refined By:
Type:  article

Results 1-21 of 21 (Search time: 0.081 seconds).

Issue DateTitleAuthor(s)TypeAccess
12005An algorithm for ranking quickest simple pathsPascoal, Marta M. B. ; Captivo, M. Eugénia V. ; Clímaco, João C. N. articleopenAccess
22017Algorithms for determining a node-disjoint path pair visiting specified nodesGomes, Teresa ; Martins, Lúcia ; Ferreira, Sofia ; Pascoal, Marta ; Tipper, David articleembargoedAccess
32016An approach to determine unsupported non-dominated solutions in bicriteria integer linear programsClímaco, João C. N. ; Pascoal, Marta articleembargoedAccess
42015An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networksCraveirinha, José M. F. ; Clímaco, João C. N. ; Martins, Lúcia M. R. A. ; Pascoal, Marta articleembargoedAccess
52006An automated reference point-like approach for multicriteria shortest path problemsClímaco, João ; Craveirinha, José ; Pascoal, Marta articleopenAccess
62013Bicriteria path problem minimizing the cost and minimizing the number of labelsPascoal, Marta ; Captivo, M. Eugénia ; Clímaco, João ; Laranjeira, Ana articleembargoedAccess
72003A bicriterion approach for routing problems in multimedia networksClímaco, João C. N. ; Craveirinha, José M. F. ; Pascoal, Marta M. B. articleopenAccess
82020Bimaterial 3D printing using galvanometer scannersBandeira, Daniel ; Pascoal, Marta ; Santos, BeatrizarticleembargoedAccess
92013Combining multicriteria analysis and tabu search for dial-a-ride problemsPaquette, Julie ; Cordeau, Jean-François ; Laporte, Gilbert ; Pascoal, Marta articleembargoedAccess
102006A comprehensive survey on the quickest path problemPascoal, Marta ; Captivo, M. ; Clímaco, João articleopenAccess
112013Constructing minimal cost/minimal SRLG spanning trees Over optical networks - An exact approachCraveirinha, José ; Clímaco, João ; Martins, Lúcia ; Pascoal, Marta articleopenAccess
122016Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenariosPascoal, Marta ; Resende, Marisa articleembargoedAccess
1330-Apr-2009Finding non-dominated bicriteria shortest pairs of disjoint simple pathsClímaco, João C. N. ; Pascoal, Marta M. B. articleopenAccess
142007Internet packet routing: Application of a K-quickest path algorithmClímaco, João C. N. ; Pascoal, Marta M. B. ; Craveirinha, José M. F. ; Captivo, M. Eugénia V. articleopenAccess
152003A new implementation of Yen’s ranking loopless paths algorithmMartins, Ernesto Q. V. ; Pascoal, Marta M. B. articleopenAccess
162001A new improvement for a K shortest paths algorithmMartins, Ernesto de Queirós Vieira ; Pascoal, Marta Margarida Braz ; Santos, José Luís Esteves articleopenAccess
172003A note on a new variant of Murty’s ranking assignments algorithmPascoal, Marta ; Captivo, M. Eugénia ; Clímaco, João articleopenAccess
182020On a relaxed maximally disjoint path pair problem: A bicriteria approachPascoal, Marta ; Clímaco, João articleembargoedAccess
192010Optimizing the profit from a complex cascade of hydroelectric stations with recirculating waterKorobeinikov, Andrei ; Kovacec, Alexander ; McGuinness, Mark ; Pascoal, Marta ; Pereira, Ana; Vilela, Sónia articleopenAccess
202015Path based algorithms for metro network designLaporte, Gilbert ; Pascoal, Marta articleembargoedAccess
212014The minmax regret robust shortest path problem in a finite multi-scenario modelPascoal, Marta ; Resende, Marisa articleembargoedAccess