Marta M. B. Pascoal

Publication Activity (10 Years)

Years Active: 1999-2020
Publications (10 Years): 4

Top Topics

Optical Networks

Exact Algorithms

Top Venues

Int. Trans. Oper. Res.

Discret. Optim.

Comput. Oper. Res.

Appl. Math. Comput.

Publications

Marta M. B. Pascoal, João C. N. Clímaco
On a relaxed maximally disjoint path pair problem: a bicriteria approach. Int. Trans. Oper. Res. 27 (4) (2020)
Marta M. B. Pascoal, Marisa Resende
Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios. Discret. Optim. 22 (2016)
José M. F. Craveirinha, João C. N. Clímaco, Lúcia M. R. A. Martins, Marta M. B. Pascoal
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks. Telecommun. Syst. 62 (2) (2016)
João C. N. Clímaco, Marta M. B. Pascoal
An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs. INFOR Inf. Syst. Oper. Res. 54 (4) (2016)
Gilbert Laporte, Marta M. B. Pascoal
Path based algorithms for metro network design. Comput. Oper. Res. 62 (2015)
Marta M. B. Pascoal, Marisa Resende
The minmax regret robust shortest path problem in a finite multi-scenario model. Appl. Math. Comput. 241 (2014)
Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco, Ana Laranjeira
Bicriteria path problem minimizing the cost and minimizing the number of labels. 4OR 11 (3) (2013)
João C. N. Clímaco, Marta M. B. Pascoal
Multicriteria path and tree problems: discussion on exact algorithms and applications. Int. Trans. Oper. Res. 19 (1-2) (2012)
Marta M. B. Pascoal, Antonio Sedeño-Noda
Enumerating K best paths in length order in DAGs. Eur. J. Oper. Res. 221 (2) (2012)
Gilbert Laporte, Marta M. B. Pascoal
Minimum cost path problems with relays. Comput. Oper. Res. 38 (1) (2011)
Leizer de Lima Pinto, Marta M. B. Pascoal
On algorithms for the tricriteria shortest path problem with two bottleneck objective functions. Comput. Oper. Res. 37 (10) (2010)
João C. N. Clímaco, M. Eugénia V. Captivo, Marta M. B. Pascoal
On the bicriterion - minimal cost/minimal label - spanning tree problem. Eur. J. Oper. Res. 204 (2) (2010)
M. Eugénia V. Captivo, João C. N. Clímaco, Marta M. B. Pascoal
A mixed integer linear formulation for the minimum label spanning tree problem. Comput. Oper. Res. 36 (11) (2009)
João C. N. Clímaco, Marta M. B. Pascoal
Finding non-dominated bicriteria shortest pairs of disjoint simple paths. Comput. Oper. Res. 36 (11) (2009)
João C. N. Clímaco, Marta M. B. Pascoal, José M. F. Craveirinha, M. Eugénia V. Captivo
Internet packet routing: Application of a K. Eur. J. Oper. Res. 181 (3) (2007)
Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco
A comprehensive survey on the quickest path problem. Ann. Oper. Res. 147 (1) (2006)
Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco
An algorithm for ranking quickest simple paths. Comput. Oper. Res. 32 (2005)
Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco
A note on a new variant of Murty's ranking assignments algorithm. 4OR 1 (3) (2003)
Ernesto de Queirós Vieira Martins, Marta M. B. Pascoal
A new implementation of Yen's ranking loopless paths algorithm. 4OR 1 (2) (2003)
João C. N. Clímaco, José M. F. Craveirinha, Marta M. B. Pascoal
A bicriterion approach for routing problems in multimedia networks. Networks 41 (4) (2003)
Ernesto de Queirós Vieira Martins, Marta M. B. Pascoal, José Luis E. Dos Santos
Deviation Algorithms for Ranking Shortest Paths. Int. J. Found. Comput. Sci. 10 (3) (1999)