|
|
|
|
|
|
Marta Pascoal
Members
|
| |
|
|
| |
|
Publications |
|
BANDEIRA, Daniel, PASCOAL, Marta, SANTOS, Beatriz (2020). Bimaterial 3D printing using galvanometer scanners. Optimization and Engineering. Vol. 21, pp. 49-72.
|
|
PASCOAL, Marta, CLÍMACO, João (2020). On a relaxed maximally disjoint path pair problem: a bicriteria approach. International Transactions in Operational Research. Vol. 27. 4, pp. 2045-2063.
|
|
BANDEIRA, Daniel, PASCOAL, Marta (2019). Modeling bimaterial 3D printing using galvanometer scanners.
|
|
CASEIRO, Raquel, PASCOAL, Marta, PENA, Gonçalo (2018). Planeta Matemático: o jogo.
|
|
PASCOAL, Marta (2018). The MinSum-MinHop and the MaxMin-MinHop bicriteria path problems. Andrew Adamatzky (Eds.), Shortest Path Solvers. From Software to Wetware. (pp. 73-97). Berlin: Springer.
|
|
PASCOAL, Marta, CLÍMACO, João (2018). Pairs of paths determination aiming to minimize the number of common arc labels and the cost algorithms.
|
|
GOMES, Teresa Martinez, MARTINS, Lúcia, FERREIRA, Sofia, PASCOAL, Marta, TIPPER, David (2017). Algorithms for determining a node-disjoint path pair visiting specified nodes. Optical Switching and Networking. Vol. 23. Part 2, pp. 189-204.
|
|
CLÍMACO, João, PASCOAL, Marta (2016). An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs. INFOR. Information Systems and Operational Research. Vol. 54. 4, pp. 317-343.
|
|
CRAVEIRINHA, José M. F., CLÍMACO, João, MARTINS, Lúcia, PASCOAL, Marta (2016). An exact method for constructing minimal cost/minimal SRLG spanning trees over optical networks. Telecommunication Systems. Vol. 62. 2, pp. 327?346.
|
|
PASCOAL, Marta, RESENDE, Marisa (2016). Dynamic preprocessing for the minmax regret robust shortest path problem with finite multi-scenarios. Discrete Optimization. Vol. 22, pp. 122-140.
| Number of registers: 20<< previous 1,2 next >>
|
| |
|
|
|
|
|
|
|
|
© 2012 Centre for Mathematics, University of Coimbra, funded by
Powered by: rdOnWeb
v1.4 | technical support
|
|
|
|
