Solution algorithms for minimizing the total tardiness with budgeted processing time uncertainty M Silva, M Poss, N Maculan European Journal of Operational Research 283 (1), 70-82, 2020 | 17 | 2020 |
Solving the bifurcated and nonbifurcated robust network loading problem with k‐adaptive routing M Silva, M Poss, N Maculan Networks 72 (1), 151-170, 2018 | 9 | 2018 |
Min-sup-min robust combinatorial optimization with few recourse solutions AN Arslan, M Poss, M Silva INFORMS Journal on Computing 34 (4), 2212-2228, 2022 | 8 | 2022 |
Deep reinforcement learning for stochastic last-mile delivery with crowdshipping M Silva, JP Pedroso, A Viana EURO Journal on Transportation and Logistics 12, 100105, 2023 | 6 | 2023 |
Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints M Silva, JP Pedroso, A Viana European Journal of Operational Research 307 (1), 249-265, 2023 | 5 | 2023 |
Deep reinforcement learning for crowdshipping last-mile delivery with endogenous uncertainty M Silva, JP Pedroso Mathematics 10 (20), 3902, 2022 | 4 | 2022 |
Distributionally robust airline fleet assignment problem. M Silva, M Poss INOC, 66-71, 2019 | 3 | 2019 |
A branch-price-and-cut algorithm for stochastic crowd shipping last-mile delivery with correlated marginals M Silva, JP Pedroso, A Viana, X Klimentova 21st Symposium on Algorithmic Approaches for Transportation Modelling …, 2021 | 2 | 2021 |
Min-max-min robust combinatorial optimization with few recourse solutions AN Arslan, M Poss, M Silva Working paper or preprint. URL https://hal. archives-ouvertes. fr/hal-02939356, 2022 | 1 | 2022 |
k-Adaptive routing for the robust network loading problem M Silva, M Poss, N Maculan Electronic Notes in Discrete Mathematics 64, 95-104, 2018 | 1 | 2018 |
Extended formulations for the min-max-min problem with few recourse solutions M Silva, AN Arslan, M Poss EasyChair, 2020 | | 2020 |
Applications and algorithms for two-stage robust linear optimization MAC Silva Universidade Federal do Rio de Janeiro, 2018 | | 2018 |
Dynamic partitioning applied to the recoverable robust knapsack problem M Silva, M Poss, N Maculan Filho, P Michelon | | |