Agostinho Agra
Orcid: 0000-0002-4672-6099
According to our database1,
Agostinho Agra
authored at least 62 papers
between 1999 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
On csauthors.net:
Bibliography
2024
Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model.
Int. Trans. Oper. Res., March, 2024
A New Algorithm Framework for the Influence Maximization Problem Using Graph Clustering.
Inf., February, 2024
EURO J. Comput. Optim., 2024
2023
Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third-party networks.
Networks, September, 2023
Optim. Lett., July, 2023
The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem.
Comput. Oper. Res., July, 2023
2022
Weighted iterated local branching for mathematical programming problems with binary variables.
J. Heuristics, 2022
Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries.
Eur. J. Oper. Res., 2022
Berth allocation and quay crane assignment/scheduling problem under uncertainty: A survey.
Eur. J. Oper. Res., 2022
2021
Opt. Switch. Netw., 2021
Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem.
INFORMS J. Comput., 2021
An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times.
Eur. J. Oper. Res., 2021
Eur. J. Oper. Res., 2021
The minimum cost network upgrade problem with maximum robustness to multiple node failures.
Comput. Oper. Res., 2021
2020
Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes.
Networks, 2020
Heuristics for a vehicle routing problem with information collection in wireless networks.
J. Heuristics, 2020
Mixed integer formulations for a routing problem with information collection in wireless networks.
Eur. J. Oper. Res., 2020
2019
Comparing techniques for modelling uncertainty in a maritime inventory routing problem.
Eur. J. Oper. Res., 2019
Discret. Appl. Math., 2019
Proceedings of the 11th International Workshop on Resilient Networks Design and Modeling, 2019
Vehicle Routing Problem for Information Collection in Wireless Networks.
Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, 2019
Evaluation and Design of Elastic Optical Networks Resilient to Multiple Node Failures.
Proceedings of the 15th International Conference on the Design of Reliable Communication Networks, 2019
2018
An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem.
Networks, 2018
MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem.
Eur. J. Oper. Res., 2018
Electron. Notes Discret. Math., 2018
Electron. Notes Discret. Math., 2018
Proceedings of the 10th International Workshop on Resilient Networks Design and Modeling, 2018
2017
Feasibility check for the distance geometry problem: an application to molecular conformations.
Int. Trans. Oper. Res., 2017
Comput. Oper. Res., 2017
Ann. Oper. Res., 2017
Proceedings of the Computational Science and Its Applications - ICCSA 2017, 2017
2016
The Minimum Cost Design of Transparent Optical Networks Combining Grooming, Routing, and Wavelength Assignment.
IEEE/ACM Trans. Netw., 2016
SIAM J. Optim., 2016
Lifted Euclidean inequalities for the integer single node flow set with upper bounds.
Eur. J. Oper. Res., 2016
Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph.
Discret. Optim., 2016
Proceedings of the Machine Learning, Optimization, and Big Data, 2016
Proceedings of the Machine Learning, Optimization, and Big Data, 2016
A MIP Based Local Search Heuristic for a Stochastic Maritime Inventory Routing Problem.
Proceedings of the Computational Logistics - 7th International Conference, 2016
2015
Discret. Optim., 2015
Comput. Oper. Res., 2015
2014
Optim. Lett., 2014
Eur. J. Oper. Res., 2014
2013
Transp. Sci., 2013
A maritime inventory routing problem: Discrete time formulations and valid inequalities.
Networks, 2013
Using decomposition to improve greedy solutions of the optimal diversity management problem.
Int. Trans. Oper. Res., 2013
Electron. Notes Discret. Math., 2013
Comput. Optim. Appl., 2013
2012
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012
2011
Int. J. Math. Model. Numer. Optimisation, 2011
Proceedings of the Network Optimization - 5th International Conference, 2011
2009
Oper. Res. Lett., 2009
2007
2006
Math. Program., 2006
1999
Oper. Res. Lett., 1999