A Agra, C Requejo
Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem
EURO Journal on Computational Optimization 12, 100081, 2024
F Rodrigues, A Agra
Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model
International Transactions in Operational Research 31 (2), 721-748 3, 2024
A Agra, JM Samuco
A New Algorithm Framework for the Influence Maximization Problem Using Graph Clustering
Information 15 (2), 112, 2024
A Agra, A Cerveira
Wind farm layout optimization under uncertainty
TOP, 1-22, 2023
A Agra
A robust model for the lot-sizing problem with uncertain demands
Optimization Letters 17 (6), 1279-1293, 2023
F Barbosa, A de Sousa, A Agra
Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third-party networks
Networks 82 (2), 87-110, 2023
MB Ahmed, LM Hvattum, A Agra
The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem
Computers & Operations Research 155, 106232, 2023
A. Agra, F. Rodrigues
Distributionally robust optimization for the berth allocation problem under uncertainty
Transportation Research Part B: Methodological 164, 1-24, 2022
A. Agra, M. Christiansen, L. A. Wolsey
Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries
European Journal of Operational Research, 297, 164-179, 2022.
F. Rodrigues, A. Agra, L.M. Hvattum, C. Requejo
Weighted proximity search
Journal of Heuristics, 28, 329-350, 2022.
F. Rodrigues, A. Agra
An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times
European Journal of Operational Research, 295, 499-516, 2021.
F. Rodrigues, A. Agra, C. Requejo, E. Delage
Lagrangian duality for robust problems with decomposable functions: the case of a robust inventory problem
Informs Journal on Computing, 33, 685-705, 2021.
F. Rodrigues, A. Agra, L.M. Hvattum, C. Requejo
Weighted proximity search
Journal of Heuristics 27, 459–496, 2021.
Öyku Attila, A Agra, K Akartunali, A Arulselvan
Robust Formulations for Economic Lot-Sizing Problem with Remanufacturing
European Journal of Operational Research 288 (2), 496-510, 2020
L. Flores, A. Agra, R. Figueiredo.
Heuristics for a vehicle routing problem with information collection in wireless networks.
Journal of Heuristics, 26 (2), 187-217, 2020.
F. Barbosa, A. Sousa, A. Agra.
Design/Upgrade of a Transparent Optical Network Topology Resilient to the Simultaneous Failure of its Critical Nodes.
Networks, 75 (4), 356-373, 2020.
L. Flores, A. Agra, R. Figueiredo.
Mixed integer formulations for a routing problem with information collection in wireless networks
European Journal of Operations Research, 280 (2), 621-638, 2020.
M. Costa, A. Agra, M. Poss.
Robust inventory theory with perishable products.
Annals of Operations Research, 289, 473–494 (2020).
A. Agra, J. O. Cerdeira, C. Requejo.
A computational comparison of compact MILP formulations for the zero forcing number.
Discrete Applied Mathematics, 269, 169-183, 2019.
F. Rodrigues, A. Agra, M. Christiansen, L.M. Hvattum, C. Requejo.
Comparing techniques for modelling uncertainty in a maritime inventory routing problem
European Journal of Operations Research, 277, 831-845, 2019.
A.
Agra, M. Christiansen, L.M. Hvattum, F.
Rodrigues. Robust
optimization for a maritime inventory
routing
problem Transportation Science, 25, 509–525, 2018.
F. Barbosa, A. de Sousa, A. Agra. Topology Design of Transparent Optical Networks Resilient to Multiple Node Failures. 10th International Workshop on Resilient Networks Design and Modeling (RNDM) (Best paper award), 1-8,
2018.
A.
Agra, M. Poss, M. Santos Optimizing make-to-stock policies through a robust lot-sizing model. International Journal of
Production Economics, 200, 302-310, 2018 (doi: 10.1016/
j.ijpe.2018.04.002.).
A.
Agra, C.Requejo, F. Rodrigues.
An
adjustable sample average approximation algorithm
for the stochastic production-inventory-routing
problem. Networks, 72, 5-24, 2018 .
A. Agra, C.Requejo, F.
Rodrigues. A hybrid heuristic for a
stochastic production-inventory-routing
problem. Electronic Notes in
Discrete Mathematics, 64, 345-354, 2018.
F.
Barbosa, A. Sousa, A. Agra. The Design of
Transparent Optical Networks
Minimizing the Impack of Critical
Nodes. Electronic
Notes in Discrete Mathematics, 64, 165-174,
2018.
A. Agra, M. Oliveira.MIP
approaches for the integrated berth allocation and quay
crane assignment and scheduling problem. European Journal of
Operations Research, 264 (1), 138-148, 2018 (link
).
A. Agra, J.O. Cerdeira, C. Requejo. A decomposition
approach for the p-median problem on disconnected graphs. Computers & Operations
Research, 86, 79-85, 2017.
Ö. N. Attila, A. Agra, K. Akartunalı, A. Arulselvan, A
decomposition algorithm for robust lot sizing problem with
remanufacturing option, Lecture Notes in Computer
Science, 10405, 684-695, 2017.
A. Agra, G. Dahl, T. Haufmann, S. J. Pinheiro. The k-Regular
Induced Subgraph Problem. Discrete Applied
Mathematics, 222, 14-30, 2017 link
.
A. Agra,
R. Figueiredo, C. Lavor, N. Maculan, A. Pereira, C. Requejo. Feasibility
check for the distance geometry problem: an
application to molecular conformations. ITOR, 24(5),
1023-1040, 2017.
A. Agra,
M. Christiansen, A. Delgado. Discrete Time and Continuous
Time Formulations for a Short Sea Inventory Routing Problem.
Optimization and Engineering, 18(1), 269-297, 2017.
A. Agra,
Marielle Christiansen, Kristine S. Ivarsoy, Ida Elise Solhaug,
Asgeir Tomasgard. Combined ship routing and inventory
management in the salmon farming industry. Annals of
Operations Research, 253, 799–823, 2017.
A. Agra, M. C. Santos, D. Nace, and M. Poss. A dynamic programming approach for a class
of robust optimization problems. SIAM Journal on Optimization, 1799-1823,
2016.
A. Agra, M. Doostmohammadi,
Cid de Souza. Valid inequalities for a single constrained
0-1 MIP set intersected with a conflict graph. Discrete
Optimization, 21, 42-70, 2016.
A. Agra, A. de Sousa, M. Doostmohammadi. The
Minimum Cost Design of Transparent Optical Networks Combining
Grooming, Routing, and Wavelength Assignment. IEEE/ACM
Transactions on Networking, 24, 3702 -
3713, 2016.
A. Agra, A. Cerveira, C. Requejo, A
branch-and-cut algorithm for a multi-item inventory
distribution problem, MOD 2016, LNCS 10122, 144-158, 2016.
A. Agra, A. Cerveira, C. Requejo, Lagrangian
relaxation bounds for a production-inventory-routing
problem, MOD 2016, LNCS 10122, 236-245, 2016.
A. Agra, M. Christiansen, L. M. Hvattum, F.
Rodrigues, A MIP based local search heuristic for a
stochastic maritime inventory routing problem, ICCL 2016,
LNCS 9855, 18-34, 2016.
A. Agra and M. Constantino. Lifted Euclidean
inequalities for the Integer Single Node Flow set with upper
bounds.
EJOR, 251, 53-63 , 2016.
A. Agra,
C. Requejo, E. Santos. Implicit Cover Inequalities.
Journal of Combinatorial Optimization. 31(3), 1111-1129,
2016.
M.
Lobato, F. Carvalho, A. S. Pereira, A., Agra. Airport
Ground Movement, in Operations Research and Big
Data, A. Póvoa, and J.L.Miranda (Eds.), Springer International
Publishing, 89 - 96, 2015.
A. Agra, M. Christiansen, A. Delgado, L.H. Hvattum.
A Maritime Inventory Routing Problem with
Stochastic Sailing and Port Times. Computers &
Operations Research, 61, 18-30, 2015.
A. Agra, M. Doostmohammadi, Q.
Louveaux. Valid Inequalities for the single arc design
problem with set-ups. Discrete Optimization, 16, 17-35,
2015.
A. Agra, M. Doostmohammadi. Facets for the single node
fixed-charge network set with a node set-up variable. Opt. Letters, 8,
1501-1515, 2014.
A. Agra, M. Christiansen, A. Delgado, L. Simonetti.
Hybrid heuristics for a
short sea inventory routing problem. EJOR, 236,
924-935, 2014.
A. Agra,
H. Andersson, M. Christiansen, L.
Wolsey. A maritime
inventory routing problem: Discrete time formulations and
valid inequalities. Networks,
62, 297–314, 2013.
(winner of of the Glover-Klingman
Prize for the best paper of the year published in
Networks in 2013)
A. Agra,
J.O. Cerdeira, C. Requejo. Using decomposition to
improve greedy solutions of the optimal diversity management
problem. ITOR, 20, 617-625,
2013 (the instances mentioned in this paper can be found here)
A. Agra,
M. Christiansen, L. M. Hvattum, R. Figueiredo, M. Poss, and C.
Requejo, The robust
vehicle routing problem with time windows, Computers &
Operations Research, 40, 856-866, 2013 .
A. Agra,
M. Doostmohammadi, Cid de Souza. Intersecting continuous
Knapsack Sets with Vertex Packing Sets, Electronic Notes
in Discrete Mathematics, 41, 327–334, 2013.
A. Agra,
M. Christiansen, A. Delgado. Mixed Integer
Formulations for a Short
Sea Fuel Oil
Distribution Problem, Transportation Science, 47, 108-124, 2013.
A.
Cerveira, A. Agra, F. Bastos, J. Gromicho. A new Branch and Bound
method for a discrete truss topology design problem. Computational Optimization and Applications, 54 (1), 163-187, 2013.
A. Agra
and M. Constantino. Mixing
polyhedra with two non divisible coefficients. Mathematical Programming, 135, 45 - 87,
2012.
A. Agra,
M. Christiansen, L. M. Hvattum, R. Figueiredo, M. Poss, and C.
Requejo, Layered
Formulation for the Robust Vehicle Routing Problem with Time
Windows,
Lecture Notes in Computer Science, 7422,
249-260, 2012.
A. Agra,
A. Cerveira, C. Requejo, E. Santos. On the Weight-Constrained
Minimum Spanning Tree Problem. Lecture Notes in Computer
Science, INOC 2011, Hamburg, Germany, 6701, 2011.
A. Agra,
C. Avelino, A. Cerveira, A. Delgado, M. Poss. Lot-sizing
and scheduling in a glass container manufacture company.
International Journal of Mathematical
Modelling and Numerical Optimisation, 2, 253-272, 2011.
A. Agra and M. Constantino. A compact
formulation of a mixed-integer set. Optimization, 59 (5), pp. 729 - 745,
2010.
A. Agra, L.
Gouveia and C. Requejo. Extended formulations for the
cardinality-constrained subtree
of a tree problem. Operations Research Letters,
37, 192-196, 2009
A. Agra
and C. Requejo. The Linking Set Problem: A polynomial
special case of the Multiple-Choice Knapsack Problem. Journal of
Mathematical Sciences,
161 (6), 2009.
A. Agra,
D. M. Cardoso, J. O. Cerdeira, M. Miranda, E. Rocha. Solving huge size
instances of the optimal diversity management problem. Journal of Mathematical Sciences, 161 (6), 2009.
A. Agra
and M. Constantino. Lifting two-integer
knapsack inequalities. Mathematical
Programming, 109 (1), 115-155, 2007.
A. Agra
and M. Constantino. Description
of 2-integer continuous knapsack polyhedra.
Discrete Optimization, 3 (2), 95—110, 2006.
A. Agra
and M. Constantino. Polyhedral
description of the integer single node flow set with constant
bounds. Mathematical Programming, B, 105 (2-3), 345-364,
2006.
A. Agra
and M. Constantino. On the
multiple integer knapsack polyhedra.
International Journal of Pure and Applied
Mathematics, 24 (4), 567-585, 2005.
A. Agra and M. Constantino.
Lotsizing with backlogging and
start-ups: the case of Wagner-Whithin
costs. Operations Research Letters,
25 (2), 81-88, 1999.