Agostinho Miguel Mendes Agra


AuthID: R-000-05M

Publications Requiring Validation

11
TITLE: Weighted iterated local branching for mathematical programming problems with binary variables
AUTHORS: Rodrigues, Filipe; Agra, Agostinho; Hvattum, Lars Magnus; Requejo, Cristina;
PUBLISHED: 2022, SOURCE: JOURNAL OF HEURISTICS, VOLUME: 28, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef: 1 Handle
IN MY: ORCID
12
TITLE: Distributionally robust optimization for the berth allocation problem under uncertainty  Full Text
AUTHORS: Agra, Agostinho; Rodrigues, Filipe;
PUBLISHED: 2022, SOURCE: TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, VOLUME: 164
INDEXED IN: Scopus WOS CrossRef: 18
IN MY: ORCID
13
TITLE: Robust formulations for economic lot-sizing problem with remanufacturing  Full Text
AUTHORS: Attila, ON; Agra, A; Akartunah, K; Arulselvan, A;
PUBLISHED: 2021, SOURCE: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, VOLUME: 288, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef: 16
IN MY: ORCID
14
TITLE: Weighted proximity search
AUTHORS: Rodrigues, F; Agra, A; Hvattum, LM; Requejo, C;
PUBLISHED: 2021, SOURCE: JOURNAL OF HEURISTICS, VOLUME: 27, ISSUE: 3
INDEXED IN: Scopus WOS CrossRef: 6 Handle
IN MY: ORCID
15
TITLE: An exact robust approach for the integrate d b erth allocation and quay crane scheduling problem under uncertain arrival times  Full Text
AUTHORS: Rodrigues, F; Agra, A;
PUBLISHED: 2021, SOURCE: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, VOLUME: 295, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef: 48
IN MY: ORCID
16
TITLE: Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem
AUTHORS: Rodrigues, F; Agra, A; Requejo, C; Delage, E;
PUBLISHED: 2021, SOURCE: INFORMS JOURNAL ON COMPUTING, VOLUME: 33, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef: 4 Handle
IN MY: ORCID
17
TITLE: RMSA algorithms resilient to multiple node failures in dynamic EONs  Full Text
AUTHORS: Barbosa, F; de Sousa, A; Agra, A; Walkowiak, K; Goscien, R;
PUBLISHED: 2021, SOURCE: OPTICAL SWITCHING AND NETWORKING, VOLUME: 42
INDEXED IN: Scopus WOS CrossRef: 3
IN MY: ORCID
18
TITLE: The minimum cost network upgrade problem with maximum robustness to multiple node failures  Full Text
AUTHORS: Barbosa, F; Agra, A; de Sousa, A;
PUBLISHED: 2021, SOURCE: COMPUTERS & OPERATIONS RESEARCH, VOLUME: 136
INDEXED IN: Scopus WOS CrossRef: 2
IN MY: ORCID
19
TITLE: Robust inventory theory with perishable products  Full Text
AUTHORS: Santos, MC; Agra, A; Poss, M;
PUBLISHED: 2020, SOURCE: ANNALS OF OPERATIONS RESEARCH, VOLUME: 289, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef: 12
IN MY: ORCID
20
TITLE: Mixed integer formulations for a routing problem with information collection in wireless networks  Full Text
AUTHORS: Flores Luyo, L; Agra, A; Figueiredo, R; Ocana, E;
PUBLISHED: 2020, SOURCE: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, VOLUME: 280, ISSUE: 2
INDEXED IN: Scopus WOS CrossRef: 11
IN MY: ORCID
Page 2 of 6. Total results: 59.

footer slogan

Useful Links

Get Help

© 2025 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service