Agostinho Agra

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