Showing results 36 to 53 of 53
< previous
| Issue Date | Title | Author(s) | Type | Access Type |
| Jun-2018 | Optimizing make-to-stock policies through a robust lot-sizing model | Agra, Agostinho; Poss, Michael; Santos, Micael | article |  |
| Sep-2023 | Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third‐party networks | Barbosa, Fábio; de Sousa, Amaro; Agra, Agostinho | article | |
| Oct-2019 | A RMSA algorithm resilient to multiple node failures on elastic optical networks | Barbosa, Fábio; Sousa, Amaro de; Agra, Agostinho; Walkowiak, Krzysztof; Goscien, Roza | conferenceObject | |
| Nov-2021 | RMSA algorithms resilient to multiple node failures in dynamic EONs | Barbosa, Fábio; Sousa, Amaro de; Agra, Agostinho; Walkowiak, Krzysztof; Goścień, Róża | article | |
| 16-Jan-2021 | Robust formulations for economic lot-sizing problem with remanufacturing | Attila, Öykü Naz; Agra, Agostinho; Akartunalı, Kerem; Arulselvan, Ashwin | article | |
| Jun-2020 | Robust inventory theory with perishable products | Santos, Marcio Costa; Agra, Agostinho; Poss, Michael | article | |
| Jul-2023 | A robust model for the lot-sizing problem with uncertain demands | Agra, Agostinho | article | |
| Jun-2018 | Robust optimization for a maritime inventory routing problem | Agra, Agostinho; Christiansen, Marielle; Hvattum, Lars Magnus; Rodrigues, Filipe Manuel | article | |
| Feb-2018 | The design of transparent optical networks minimizing the impact of critical nodes | Barbosa, Fábio; Sousa, Amaro de; Agra, Agostinho | article |  |
| Jul-2023 | The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem | Ben Ahmed, Mohamed; Hvattum, Lars Magnus; Agra, Agostinho | article | |
| 11-May-2017 | The k-regular induced subgraph problem | Agra, Agostinho; Dahl, Geir; Haufmann, Torkel A.; Pinheiro, Sofia J. | article | |
| Apr-2016 | The minimum cost design of transparent optical networks combining grooming, routing, and wavelength assignment | Agra, Agostinho; Sousa, Amaro de; Doostmohammadi, Mahdi | article | |
| Dec-2021 | The minimum cost network upgrade problem with maximum robustness to multiple node failures | Barbosa, Fábio; Agra, Agostinho; Sousa, Amaro de | article | |
| 10-Oct-2018 | Topology design of transparent optical networks resilient to multiple node failures | Barbosa, Fábio; de Sousa, Amaro; Agra, Agostinho | conferenceObject | |
| Aug-2016 | Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph | Agra, Agostinho; Doostmohammadi, Mahdi; Souza, Cid C. de | article | |
| May-2015 | Valid inequalities for the single arc design problem with set-ups | Agra, Agostinho; Doostmohammadi, Mahdi; Louveaux, Quentin | article | |
| Jun-2022 | Weighted iterated local branching for mathematical programming problems with binary variables | Rodrigues, Filipe; Agra, Agostinho; Hvattum, Lars Magnus; Requejo, Cristina | article | |
| Jun-2021 | Weighted proximity search | Rodrigues, Filipe; Agra, Agostinho; Hvattum, Lars Magnus; Requejo, Cristina | article | |