Marta M. B. Pascoal

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