Search the dblp DataBase

Publications of Author

1. Ernesto de Queirós Vieira Martins, Marta M. B. Pascoal
   A new implementation of Yen's ranking loopless paths algorithm. [Citation Graph (0, 0)][DBLP]
   4OR, 2003, v:1, n:2, pp:121-133 [Journal]
   
2. 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. [Citation Graph (0, 0)][DBLP]
   4OR, 2003, v:1, n:3, pp:243-255 [Journal]
   
3. Marta M. B. Pascoal, M. Eugénia V. Captivo, João C. N. Clímaco
   An algorithm for ranking quickest simple paths. [Citation Graph (0, 0)][DBLP]
   Computers & OR, 2005, v:32, n:, pp:509-520 [Journal]
   
4. Ernesto de Queirós Vieira Martins, Marta M. B. Pascoal, José Luis E. Dos Santos
   Deviation Algorithms for Ranking Shortest Paths. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 1999, v:10, n:3, pp:247-262 [Journal]
   
5. João C. N. Clímaco, José M. F. Craveirinha, Marta M. B. Pascoal
   A bicriterion approach for routing problems in multimedia networks. [Citation Graph (0, 0)][DBLP]
   Networks, 2003, v:41, n:4, pp:206-220 [Journal]
   
6. 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. [Citation Graph (0, 0)][DBLP]
   European Journal of Operational Research, 2007, v:181, n:3, pp:1045-1054 [Journal]
   
7. 
   A mixed integer linear formulation for the minimum label spanning tree problem. [Citation Graph (, )][DBLP]
   
   
8. 
   Finding non-dominated bicriteria shortest pairs of disjoint simple paths. [Citation Graph (, )][DBLP]
   
   
9. 
   On algorithms for the tricriteria shortest path problem with two bottleneck objective functions. [Citation Graph (, )][DBLP]
   
   
10. 
    Minimum cost path problems with relays. [Citation Graph (, )][DBLP]