Agostinho Agra

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 43

Top Topics

Lagrangian Relaxation

Valid Inequalities

Routing Problem

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Publications

Agostinho Agra, Cristina Requejo
Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem. EURO J. Comput. Optim. 12 (2024)
Filipe Rodrigues, Agostinho Agra
Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model. Int. Trans. Oper. Res. 31 (2) (2024)
Agostinho Agra, Jose Maria Samuco
A New Algorithm Framework for the Influence Maximization Problem Using Graph Clustering. Inf. 15 (2) (2024)
Agostinho Agra
A robust model for the lot-sizing problem with uncertain demands. Optim. Lett. 17 (6) (2023)
Mohamed Ben Ahmed, Lars Magnus Hvattum, Agostinho Agra
The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem. Comput. Oper. Res. 155 (2023)
Fábio Barbosa, Amaro de Sousa, Agostinho Agra
Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third-party networks. Networks 82 (2) (2023)
Agostinho Agra, Marielle Christiansen, Laurence A. Wolsey
Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries. Eur. J. Oper. Res. 297 (1) (2022)
Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo
Weighted iterated local branching for mathematical programming problems with binary variables. J. Heuristics 28 (3) (2022)
Filipe Rodrigues, Agostinho Agra
Berth allocation and quay crane assignment/scheduling problem under uncertainty: A survey. Eur. J. Oper. Res. 303 (2) (2022)
Fábio Barbosa, Agostinho Agra, Amaro de Sousa
The minimum cost network upgrade problem with maximum robustness to multiple node failures. Comput. Oper. Res. 136 (2021)
Öykü Naz Attila, Agostinho Agra, Kerem Akartunali, Ashwin Arulselvan
Robust formulations for economic lot-sizing problem with remanufacturing. Eur. J. Oper. Res. 288 (2) (2021)
Filipe Rodrigues, Agostinho Agra, Cristina Requejo, Erick Delage
Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem. INFORMS J. Comput. 33 (2) (2021)
Fábio Barbosa, Amaro de Sousa, Agostinho Agra, Krzysztof Walkowiak, Róza Goscien
RMSA algorithms resilient to multiple node failures in dynamic EONs. Opt. Switch. Netw. 42 (2021)
Filipe Rodrigues, Agostinho Agra
An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times. Eur. J. Oper. Res. 295 (2) (2021)
Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo
Weighted proximity search. J. Heuristics 27 (3) (2021)
Luis Ernesto Flores Luyo, Agostinho Agra, Rosa Figueiredo, Eladio Ocaña Anaya
Heuristics for a vehicle routing problem with information collection in wireless networks. J. Heuristics 26 (2) (2020)
Marcio Costa Santos, Agostinho Agra, Michael Poss
Robust inventory theory with perishable products. Ann. Oper. Res. 289 (2) (2020)
Fabio Barbosa, Amaro de Sousa, Agostinho Agra
Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes. Networks 75 (4) (2020)
Luis Ernesto Flores Luyo, Agostinho Agra, Rosa Figueiredo, Eladio Ocaña Anaya
Mixed integer formulations for a routing problem with information collection in wireless networks. Eur. J. Oper. Res. 280 (2) (2020)
Fabio Barbosa, Amaro de Sousa, Agostinho Agra
Evaluation and Design of Elastic Optical Networks Resilient to Multiple Node Failures. DRCN (2019)
Luis Ernesto Flores Luyo, Agostinho Agra, Rosa Figueiredo, Eitan Altman, Eladio Ocaña Anaya
Vehicle Routing Problem for Information Collection in Wireless Networks. ICORES (2019)
Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo
A computational comparison of compact MILP formulations for the zero forcing number. Discret. Appl. Math. 269 (2019)
Filipe Rodrigues, Agostinho Agra, Marielle Christiansen, Lars Magnus Hvattum, Cristina Requejo
Comparing techniques for modelling uncertainty in a maritime inventory routing problem. Eur. J. Oper. Res. 277 (3) (2019)
Fabio Barbosa, Amaro de Sousa, Agostinho Agra, Krzysztof Walkowiak, Róza Goscien
A RMSA Algorithm Resilient to Multiple Node Failures on Elastic Optical Networks. RNDM (2019)
Agostinho Agra, Cristina Requejo, Filipe Rodrigues
A hybrid heuristic for a stochastic production-inventory-routing problem. Electron. Notes Discret. Math. 64 (2018)
Fabio Barbosa, Amaro de Sousa, Agostinho Agra
The Design of Transparent Optical Networks Minimizing the Impact of Critical Nodes. Electron. Notes Discret. Math. 64 (2018)
Agostinho Agra, Marielle Christiansen, Lars Magnus Hvattum, Filipe Rodrigues
Robust Optimization for a Maritime Inventory Routing Problem. Transp. Sci. 52 (3) (2018)
Agostinho Agra, Maryse Oliveira
MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem. Eur. J. Oper. Res. 264 (1) (2018)
Fabio Barbosa, Amaro de Sousa, Agostinho Agra
Topology Design of Transparent Optical Networks Resilient to Multiple Node Failures. RNDM (2018)
Agostinho Agra, Cristina Requejo, Filipe Rodrigues
An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem. Networks 72 (1) (2018)
Agostinho Agra, Rosa Figueiredo, Carlile Lavor, Nelson Maculan, António Pereira, Cristina Requejo
Feasibility check for the distance geometry problem: an application to molecular conformations. Int. Trans. Oper. Res. 24 (5) (2017)
Agostinho Agra, Marielle Christiansen, Kristine S. Ivarsøy, Ida Elise Solhaug, Asgeir Tomasgard
Combined ship routing and inventory management in the salmon farming industry. Ann. Oper. Res. 253 (2) (2017)
Öykü Naz Attila, Agostinho Agra, Kerem Akartunali, Ashwin Arulselvan
A Decomposition Algorithm for Robust Lot Sizing Problem with Remanufacturing Option. ICCSA (2) (2017)
Agostinho Agra, Geir Dahl, Torkel Andreas Haufmann, Sofia J. Pinheiro
The k-regular induced subgraph problem. Discret. Appl. Math. 222 (2017)
Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo
A decomposition approach for the p-median problem on disconnected graphs. Comput. Oper. Res. 86 (2017)
Agostinho Agra, Cristina Requejo, Eulália Santos
Implicit cover inequalities. J. Comb. Optim. 31 (3) (2016)
Agostinho Agra, Mahdi Doostmohammadi, Cid C. de Souza
Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph. Discret. Optim. 21 (2016)
Agostinho Agra, Marielle Christiansen, Lars Magnus Hvattum, Filipe Rodrigues
A MIP Based Local Search Heuristic for a Stochastic Maritime Inventory Routing Problem. ICCL (2016)
Agostinho Agra, Marcio Costa Santos, Dritan Nace, Michael Poss
A Dynamic Programming Approach for a Class of Robust Optimization Problems. SIAM J. Optim. 26 (3) (2016)
Agostinho Agra, Adelaide Cerveira, Cristina Requejo
Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem. MOD (2016)
Agostinho Agra, Adelaide Cerveira, Cristina Requejo
A Branch-and-Cut Algorithm for a Multi-item Inventory Distribution Problem. MOD (2016)
Agostinho Agra, Miguel Fragoso Constantino
Lifted Euclidean inequalities for the integer single node flow set with upper bounds. Eur. J. Oper. Res. 251 (1) (2016)
Agostinho Agra, Amaro de Sousa, Mahdi Doostmohammadi
The Minimum Cost Design of Transparent Optical Networks Combining Grooming, Routing, and Wavelength Assignment. IEEE/ACM Trans. Netw. 24 (6) (2016)
Agostinho Agra, Marielle Christiansen, Alexandrino Delgado, Lars Magnus Hvattum
A maritime inventory routing problem with stochastic sailing and port times. Comput. Oper. Res. 61 (2015)
Agostinho Agra, Mahdi Doostmohammadi, Quentin Louveaux
Valid inequalities for the single arc design problem with set-ups. Discret. Optim. 16 (2015)
Agostinho Agra, Mahdi Doostmohammadi
Facets for the single node fixed-charge network set with a node set-up variable. Optim. Lett. 8 (4) (2014)
Agostinho Agra, Marielle Christiansen, Alexandrino Delgado, Luidi Simonetti
Hybrid heuristics for a short sea inventory routing problem. Eur. J. Oper. Res. 236 (3) (2014)
Agostinho Agra, Henrik Andersson, Marielle Christiansen, Laurence A. Wolsey
A maritime inventory routing problem: Discrete time formulations and valid inequalities. Networks 62 (4) (2013)
Adelaide Cerveira, Agostinho Agra, Fernando Bastos, Joaquim A. S. Gromicho
A new Branch and Bound method for a discrete truss topology design problem. Comput. Optim. Appl. 54 (1) (2013)
Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo
The robust vehicle routing problem with time windows. Comput. Oper. Res. 40 (3) (2013)
Agostinho Agra, Mahdi Doostmohammadi, Cid Carvalho de Souza
Intersecting a simple mixed integer set with a vertex packing set. Electron. Notes Discret. Math. 41 (2013)
Agostinho Agra, Marielle Christiansen, Alexandrino Delgado
Mixed Integer Formulations for a Short Sea Fuel Oil Distribution Problem. Transp. Sci. 47 (1) (2013)
Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo
Using decomposition to improve greedy solutions of the optimal diversity management problem. Int. Trans. Oper. Res. 20 (5) (2013)
Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows. ISCO (2012)
Agostinho Agra, Miguel Fragoso Constantino
Mixing polyhedra with two non divisible coefficients. Math. Program. 135 (1-2) (2012)
Agostinho Agra, Catarina P. Avelino, Adelaide Cerveira, Alexandrino Delgado, Michael Poss
Lot-sizing and scheduling in a glass container manufacture company. Int. J. Math. Model. Numer. Optimisation 2 (3) (2011)
Agostinho Agra, Adelaide Cerveira, Cristina Requejo, Eulália Santos
On the Weight-Constrained Minimum Spanning Tree Problem. INOC (2011)
Agostinho Agra, Luis Eduardo Neves Gouveia, Cristina Requejo
Extended formulations for the cardinality constrained subtree of a tree problem. Oper. Res. Lett. 37 (3) (2009)
Agostinho Agra, Miguel Fragoso Constantino
Lifting two-integer knapsack inequalities. Math. Program. 109 (1) (2007)
Agostinho Agra, Miguel Fragoso Constantino
Description of 2-integer continuous knapsack polyhedra. Discret. Optim. 3 (2) (2006)
Agostinho Agra, Miguel Fragoso Constantino
Polyhedral description of the integer single node flow set with constant bounds. Math. Program. 105 (2-3) (2006)
Agostinho Agra, Miguel Fragoso Constantino
Lotsizing with backlogging and start-ups: the case of Wagner-Whitin costs. Oper. Res. Lett. 25 (2) (1999)