11
TÍTULO: Modeling Bimaterial 3D Printing Using Galvanometer Mirror Scanners
AUTORES: Daniel Bandeira; Marta Pascoal;
PUBLICAÇÃO: 2019, FONTE: Mathematics in Industry - Progress in Industrial Mathematics at ECMI 2018
INDEXADO EM: CrossRef
NO MEU: ORCID
12
TÍTULO: The MinSum-MinHop and the MaxMin-MinHop Bicriteria Path Problems
AUTORES: Marta Pascoal;
PUBLICAÇÃO: 2018, FONTE: Emergence, Complexity and Computation - Shortest Path Solvers. From Software to Wetware
INDEXADO EM: CrossRef: 1
NO MEU: ORCID
13
TÍTULO: Algorithms for determining a node-disjoint path pair visiting specified nodes
AUTORES: Gomes, T; Martins, L; Ferreira, S; Pascoal, M; Tipper, D;
PUBLICAÇÃO: 2017, FONTE: Optical Switching and Networking in OPTICAL SWITCHING AND NETWORKING, VOLUME: 23
INDEXADO EM: Scopus WOS CrossRef: 18 Handle
NO MEU: ORCID
14
TÍTULO: An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks
AUTORES: Craveirinha, JMF; Climaco, JCN; Martins, LMRA; Pascoal, MMB;
PUBLICAÇÃO: 2016, FONTE: International Conference on Networking and Electronic Commerce in TELECOMMUNICATION SYSTEMS, VOLUME: 62, NÚMERO: 2
INDEXADO EM: Scopus WOS CrossRef Handle
NO MEU: ORCID
15
TÍTULO: Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios
AUTORES: Pascoal, MMB; Resende, M;
PUBLICAÇÃO: 2016, FONTE: 3rd International-Symposium on Combinatorial Optimization (ISCO) in DISCRETE OPTIMIZATION, VOLUME: 22
INDEXADO EM: WOS CrossRef Handle
NO MEU: ORCID
16
TÍTULO: An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs  Full Text
AUTORES: Climaco, JCN; Pascoal, MMB;
PUBLICAÇÃO: 2016, FONTE: INFOR: Information Systems and Operational Research in INFOR, VOLUME: 54, NÚMERO: 4
INDEXADO EM: Scopus WOS CrossRef: 5 Handle
NO MEU: ORCID
17
TÍTULO: Path based algorithms for metro network design
AUTORES: Laporte, G; Pascoal, MMB;
PUBLICAÇÃO: 2015, FONTE: Computers & Operations Research in COMPUTERS & OPERATIONS RESEARCH, VOLUME: 62
INDEXADO EM: Scopus WOS CrossRef Handle
NO MEU: ORCID
18
TÍTULO: Protected shortest path visiting specified nodes
AUTORES: Gomes, T; Marques, S; Martins, L; Pascoal, M; Tipper, D;
PUBLICAÇÃO: 2015, FONTE: 7th International Workshop on Reliable Networks Design and Modeling, RNDM 2015 in Proceedings of 2015 7th International Workshop on Reliable Networks Design and Modeling, RNDM 2015
INDEXADO EM: Scopus CrossRef
NO MEU: ORCID
19
TÍTULO: Reducing the Minmax Regret Robust Shortest Path Problem with Finite Multi-scenarios
AUTORES: Marta M B Pascoal; Marisa Resende;
PUBLICAÇÃO: 2015, FONTE: International Conference on and Advanced School Planet Earth, Mathematics of Energy and Climate Change (MECC) in MATHEMATICS OF ENERGY AND CLIMATE CHANGE
INDEXADO EM: WOS CrossRef
NO MEU: ORCID
20
TÍTULO: Protected shortest path visiting specified nodes
AUTORES: Teresa Gomes; Sofia Marques; Lucia Martins; Marta Pascoal; David Tipper;
PUBLICAÇÃO: 2015, FONTE: 7th International Workshop Reliable Networks Design Modeling (RNDM 2015) in 2015 7TH INTERNATIONAL WORKSHOP ON RELIABLE NETWORKS DESIGN AND MODELING (RNDM) PROCE4EDINGS
INDEXADO EM: WOS
Página 2 de 4. Total de resultados: 34.