Sfoglia per Autore
DEVIATION ALGORITHMS FOR RANKING SHORTEST PATHS
1999-01-01 Martins, E.; Marta, Pascoal; Santos, J. L.
A Bicriterion Approach for Routing Problems in Multimedia Networks
2003-01-01 Climaco, J. C. N.; Craveirinha, J. M. F.; Pascoal, M.
A new implementation of Yen's ranking loopless paths algorithm
2003-01-01 Martins, E. Q. V.; Pascoal, M.
A note on a new variant of Murty's ranking assignments algorithm
2003-01-01 Pascoal, M.; Captivo, M. E.; Climaco, J.
An algorithm for ranking quickest simple paths
2005-01-01 Pascoal, M.; Captivo, M. E. V.; Climaco, J. C. N.
An automated reference point-like approach for multicriteria shortest path problems
2006-01-01 Climaco, J. C. N.; Craveirinha, J. M. F.; Pascoal, M.
A comprehensive survey on the quickest path problem
2006-01-01 Pascoal, M.; Captivo, M. E. V.; Climaco, J. C. N.
Internet packet routing: Application of a K-quickest path algorithm
2007-01-01 Climaco, J. C. N.; Pascoal, M.; Craveirinha, J. M. F.; Captivo, M. E. V.
Computational experiments with a lazy version of a K quickest simple path ranking algorithm
2007-01-01 Pascoal, M.; Captivo, M. E.; Clãmaco, J. C.
Experiential learning in Science: getting the laboratory inside the classroom using the Web
2009-01-01 De Almeida, A. M.; Pascoal, M.; Joao, Fernandes; Pereira, S.
A mixed integer linear formulation for the minimum label spanning tree problem
2009-01-01 Captivo, M. E.; Climaco, J. C. N.; Pascoal, M.
Finding non-dominated bicriteria shortest pairs of disjoint simple paths
2009-01-01 Climaco, J. C. N.; Pascoal, M.
On the bicriterion - minimal cost/minimal label - spanning tree problem
2010-01-01 Climaco, J. C. N.; Eugenia Captivo, M.; Pascoal, M.
On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
2010-01-01 Pinto, L. L.; Pascoal, M.
Minimum cost path problems with relays
2011-01-01 Laporte, G.; Pascoal, M.
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization
2012-01-01 Bornstein, C. T.; Maculan, N.; Pascoal, M.; Pinto, L. L.
The pipeline and valve location problem
2012-01-01 Laporte, G.; Pascoal, M.
Multicriteria path and tree problems: Discussion on exact algorithms and applications
2012-01-01 Climaco, J. C. N.; Pascoal, M.
Enumerating K best paths in length order in DAGs
2012-01-01 Pascoal, M.; Sedeno-Noda, A.
Bicriteria path problem minimizing the cost and minimizing the number of labels
2013-01-01 Pascoal, M.; Captivo, M. E.; Climaco, J.; Laranjeira, A.
Combining multicriteria analysis and tabu search for dial-a-ride problems
2013-01-01 Paquette, J.; Cordeau, J. -F.; Laporte, G.; Pascoal, M.
The minmax regret robust shortest path problem in a finite multi-scenario model
2014-01-01 Pascoal, M.; Resende, M.
Path based algorithms for metro network design
2015-01-01 Laporte, G.; Pascoal, M.
Protected shortest path visiting specified nodes
2015-01-01 Gomes, T; Marques, S; Martins, Lucia; Pascoal, M; Tipper, D
Reducing the Minmax Regret Robust Shortest Path Problem with Finite Multi-scenarios
2015-01-01 Pascoal, M.; Resende, Marisa
An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks
2016-01-01 Craveirinha, J. M. F.; Climaco, J. C. N.; Martins, L. M. R. A.; Pascoal, M
An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
2016-01-01 Climaco, J. C. N.; Pascoal, M
Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
2016-01-01 Pascoal, M.; Resende, M.
Algorithms for determining a node-disjoint path pair visiting specified nodes
2017-01-01 Gomes, T.; Lucia, Martins; Ferreira, S.; Pascoal, M.; Tipper, D.
The {MinSum}-{MinHop} and the {MaxMin}-{MinHop} Bicriteria Path Problems
2018-01-01 Pascoal, Marta
Modeling Bimaterial 3D Printing Using Galvanometer Mirror Scanners
2019-01-01 Bandeira, Daniel; Pascoal, Marta
Bimaterial 3D printing using galvanometer scanners
2020-01-01 Bandeira, D.; Pascoal, M.; Santos, B.
On a relaxed maximally disjoint path pair problem: a bicriteria approach
2020-01-01 Pascoal, M. M. B.; Climaco, J. C. N.
The Rough Interval Shortest Path Problem
2021-01-01 Moghanni, A.; Pascoal, M.
An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks
2022-01-01 Pascoal, M.; Craveirinha, J.; Climaco, J.
Finding K shortest and dissimilar paths
2022-01-01 Moghanni, A.; Pascoal, M.; Godinho, M. T.
The electric vehicle shortest path problem with time windows and prize collection
2022-01-01 Cassia, Antonio; Jabali, Ola; Malucelli, Federico; Pascoal, Marta
Finding K dissimilar paths: Single-commodity and discretized flow formulations
2022-01-01 Moghanni, A; Pascoal, M; Godinho, Mt
Implementation of Geographic Diversity in Resilient Telecommunication Networks
2023-01-01 Godinho, Maria Teresa; Pascoal, Marta
Bimaterial Three-Dimensional Printing Using Digital Light Processing Projectors
2023-01-01 Bandeira, Daniel; Pascoal, Marta
New Models for Finding K Short and Dissimilar Paths
2023-01-01 Pascoal, Marta; Godinho, Maria Teresa; Moghanni, Ali
An exact approach for finding bicriteria maximally SRLG-disjoint/shortest path pairs in telecommunication networks
2023-01-01 Craveirinha, José; Pascoal, Marta; Clímaco, João
Optimizing the integration of express bus services with micro-mobility: a case study
2024-01-01 Candiani, Manuel; Malucelli, Federico; Pascoal, Marta; Schettini, Tommaso
Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends
2024-01-01 Craveirinha, José; Clímaco, João; Girão-Silva, Rita; Pascoal, Marta
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile