Search: Faculdade de Economia
Results 1-9 of 9 (Search time: 0.153 seconds).
- previous
- 1
- next
Item hits:
| Issue Date | Title | Author(s) | Type | Access | |
|---|---|---|---|---|---|
| 1 | 2008 | Capacitated single allocation hub location problem--A bi-criteria approach | Costa, Maria da Graça ; Captivo, Maria Eugénia ; Clímaco, João | article | openAccess |
| 2 | 2005 | An algorithm for ranking quickest simple paths | Pascoal, Marta M. B. ; Captivo, M. Eugénia V. ; Clímaco, João C. N. | article | openAccess |
| 3 | 2007 | Internet packet routing: Application of a K-quickest path algorithm | Clímaco, João C. N. ; Pascoal, Marta M. B. ; Craveirinha, José M. F. ; Captivo, M. Eugénia V. | article | openAccess |
| 4 | 2007 | Efficient primal-dual heuristic for a dynamic location problem | Dias, Joana ; Captivo, M. Eugénia ; Clímaco, João | article | openAccess |
| 5 | 2003 | A note on a new variant of Murty’s ranking assignments algorithm | Pascoal, Marta ; Captivo, M. Eugénia ; Clímaco, João | article | openAccess |
| 6 | 2006 | A comprehensive survey on the quickest path problem | Pascoal, Marta ; Captivo, M. ; Clímaco, João | article | openAccess |
| 7 | 2008 | A dynamic location problem with maximum decreasing capacities | Dias, Joana ; Captivo, M. ; Clímaco, João | article | openAccess |
| 8 | 2008 | A memetic algorithm for multi-objective dynamic location problems | Dias, Joana ; Captivo, M. ; Clímaco, João | article | openAccess |
| 9 | 2007 | Computational experiments with a lazy version of a K quickest simple path ranking algorithm | Pascoal, M. ; Captivo, M. ; Clímaco, J. | article | openAccess |