Lotsizing with backlogging and start-ups: the case of Wagner-Whitin costs. - Agostinho Agra; Miguel Fragoso Constantino (Oper. Res. Lett., 1999)

Description of 2-integer continuous knapsack polyhedra. - Agostinho Agra; Miguel Fragoso Constantino (Discret. Optim., 2006)

Polyhedral description of the integer single node flow set with constant bounds. - Agostinho Agra; Miguel Fragoso Constantino (Math. Program., 2006)

Lifting two-integer knapsack inequalities. - Agostinho Agra; Miguel Fragoso Constantino (Math. Program., 2007)

Extended formulations for the cardinality constrained subtree of a tree problem. - Agostinho Agra; Luis Eduardo Neves Gouveia; Cristina Requejo (Oper. Res. Lett., 2009)

On the Weight-Constrained Minimum Spanning Tree Problem. - Agostinho Agra; Adelaide Cerveira; Cristina Requejo; Eulália Santos (INOC, 2011)

Lot-sizing and scheduling in a glass container manufacture company. - Agostinho Agra; Catarina P. Avelino; Adelaide Cerveira; Alexandrino Delgado; Michael Poss (Int. J. Math. Model. Numer. Optimisation, 2011)

Layered Formulation for the Robust Vehicle Routing Problem with Time Windows. - Agostinho Agra; Marielle Christiansen; Rosa M. V. Figueiredo; Lars Magnus Hvattum; Michael Poss; Cristina Requejo (ISCO, 2012)

Mixing polyhedra with two non divisible coefficients. - Agostinho Agra; Miguel Fragoso Constantino (Math. Program., 2012)

A new Branch and Bound method for a discrete truss topology design problem. - Adelaide Cerveira; Agostinho Agra; Fernando Bastos; Joaquim A. S. Gromicho (Comput. Optim. Appl., 2013)

The robust vehicle routing problem with time windows. - Agostinho Agra; Marielle Christiansen; Rosa M. V. Figueiredo; Lars Magnus Hvattum; Michael Poss; Cristina Requejo (Comput. Oper. Res., 2013)

Intersecting a simple mixed integer set with a vertex packing set. - Agostinho Agra; Mahdi Doostmohammadi; Cid Carvalho de Souza (Electron. Notes Discret. Math., 2013)

Using decomposition to improve greedy solutions of the optimal diversity management problem. - Agostinho Agra; Jorge Orestes Cerdeira; Cristina Requejo (Int. Trans. Oper. Res., 2013)

A maritime inventory routing problem: Discrete time formulations and valid inequalities. - Agostinho Agra; Henrik Andersson; Marielle Christiansen; Laurence A. Wolsey (Networks, 2013)

Mixed Integer Formulations for a Short Sea Fuel Oil Distribution Problem. - Agostinho Agra; Marielle Christiansen; Alexandrino Delgado (Transp. Sci., 2013)

Hybrid heuristics for a short sea inventory routing problem. - Agostinho Agra; Marielle Christiansen; Alexandrino Delgado; Luidi Simonetti (Eur. J. Oper. Res., 2014)

Facets for the single node fixed-charge network set with a node set-up variable. - Agostinho Agra; Mahdi Doostmohammadi (Optim. Lett., 2014)

A maritime inventory routing problem with stochastic sailing and port times. - Agostinho Agra; Marielle Christiansen; Alexandrino Delgado; Lars Magnus Hvattum (Comput. Oper. Res., 2015)

Valid inequalities for the single arc design problem with set-ups. - Agostinho Agra; Mahdi Doostmohammadi; Quentin Louveaux (Discret. Optim., 2015)

A MIP Based Local Search Heuristic for a Stochastic Maritime Inventory Routing Problem. - Agostinho Agra; Marielle Christiansen; Lars Magnus Hvattum; Filipe Rodrigues 002 (ICCL, 2016)

A Branch-and-Cut Algorithm for a Multi-item Inventory Distribution Problem. - Agostinho Agra; Adelaide Cerveira; Cristina Requejo (MOD, 2016)

Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem. - Agostinho Agra; Adelaide Cerveira; Cristina Requejo (MOD, 2016)

Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph. - Agostinho Agra; Mahdi Doostmohammadi; Cid C. de Souza (Discret. Optim., 2016)

Lifted Euclidean inequalities for the integer single node flow set with upper bounds. - Agostinho Agra; Miguel Fragoso Constantino (Eur. J. Oper. Res., 2016)

Implicit cover inequalities. - Agostinho Agra; Cristina Requejo; Eulália Santos (J. Comb. Optim., 2016)

A Dynamic Programming Approach for a Class of Robust Optimization Problems. - Agostinho Agra; Marcio Costa Santos; Dritan Nace; Michael Poss (SIAM J. Optim., 2016)

The Minimum Cost Design of Transparent Optical Networks Combining Grooming, Routing, and Wavelength Assignment. - Agostinho Agra; Amaro de Sousa; Mahdi Doostmohammadi (IEEE/ACM Trans. Netw., 2016)

A Decomposition Algorithm for Robust Lot Sizing Problem with Remanufacturing Option. - Öykü Naz Attila; Agostinho Agra; Kerem Akartunali; Ashwin Arulselvan (ICCSA (2), 2017)

Combined ship routing and inventory management in the salmon farming industry. - Agostinho Agra; Marielle Christiansen; Kristine S. Ivarsøy; Ida Elise Solhaug; Asgeir Tomasgard (Ann. Oper. Res., 2017)

A decomposition approach for the p-median problem on disconnected graphs. - Agostinho Agra; Jorge Orestes Cerdeira; Cristina Requejo (Comput. Oper. Res., 2017)

The k-regular induced subgraph problem. - Agostinho Agra; Geir Dahl; Torkel Andreas Haufmann; Sofia J. Pinheiro (Discret. Appl. Math., 2017)

Feasibility check for the distance geometry problem: an application to molecular conformations. - Agostinho Agra; Rosa Figueiredo 001; Carlile Lavor; Nelson Maculan; António Pereira 002; Cristina Requejo (Int. Trans. Oper. Res., 2017)

Topology Design of Transparent Optical Networks Resilient to Multiple Node Failures. - Fabio Barbosa; Amaro de Sousa; Agostinho Agra (RNDM, 2018)

A hybrid heuristic for a stochastic production-inventory-routing problem. - Agostinho Agra; Cristina Requejo; Filipe Rodrigues 002 (Electron. Notes Discret. Math., 2018)

The Design of Transparent Optical Networks Minimizing the Impact of Critical Nodes. - Fabio Barbosa; Amaro de Sousa; Agostinho Agra (Electron. Notes Discret. Math., 2018)

MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem. - Agostinho Agra; Maryse Oliveira (Eur. J. Oper. Res., 2018)

An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem. - Agostinho Agra; Cristina Requejo; Filipe Rodrigues 002 (Networks, 2018)

Robust Optimization for a Maritime Inventory Routing Problem. - Agostinho Agra; Marielle Christiansen; Lars Magnus Hvattum; Filipe Rodrigues 002 (Transp. Sci., 2018)

Evaluation and Design of Elastic Optical Networks Resilient to Multiple Node Failures. - Fabio Barbosa; Amaro de Sousa; Agostinho Agra (DRCN, 2019)

Vehicle Routing Problem for Information Collection in Wireless Networks. - Luis Ernesto Flores Luyo; Agostinho Agra; Rosa Figueiredo 001; Eitan Altman; Eladio Ocaña Anaya (ICORES, 2019)

A RMSA Algorithm Resilient to Multiple Node Failures on Elastic Optical Networks. - Fabio Barbosa; Amaro de Sousa; Agostinho Agra; Krzysztof Walkowiak; Róza Goscien (RNDM, 2019)

A computational comparison of compact MILP formulations for the zero forcing number. - Agostinho Agra; Jorge Orestes Cerdeira; Cristina Requejo (Discret. Appl. Math., 2019)

Comparing techniques for modelling uncertainty in a maritime inventory routing problem. - Filipe Rodrigues 002; Agostinho Agra; Marielle Christiansen; Lars Magnus Hvattum; Cristina Requejo (Eur. J. Oper. Res., 2019)

Robust inventory theory with perishable products. - Marcio Costa Santos; Agostinho Agra; Michael Poss (Ann. Oper. Res., 2020)

Mixed integer formulations for a routing problem with information collection in wireless networks. - Luis Ernesto Flores Luyo; Agostinho Agra; Rosa Figueiredo 001; Eladio Ocaña Anaya (Eur. J. Oper. Res., 2020)

Heuristics for a vehicle routing problem with information collection in wireless networks. - Luis Ernesto Flores Luyo; Agostinho Agra; Rosa Figueiredo 001; Eladio Ocaña Anaya (J. Heuristics, 2020)

Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes. - Fabio Barbosa; Amaro de Sousa; Agostinho Agra (Networks, 2020)

The minimum cost network upgrade problem with maximum robustness to multiple node failures. - Fábio Barbosa; Agostinho Agra; Amaro de Sousa (Comput. Oper. Res., 2021)

Robust formulations for economic lot-sizing problem with remanufacturing. - Öykü Naz Attila; Agostinho Agra; Kerem Akartunali; Ashwin Arulselvan (Eur. J. Oper. Res., 2021)

An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times. - Filipe Rodrigues 002; Agostinho Agra (Eur. J. Oper. Res., 2021)

Weighted proximity search. - Filipe Rodrigues 002; Agostinho Agra; Lars Magnus Hvattum; Cristina Requejo (J. Heuristics, 2021)

Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem. - Filipe Rodrigues 002; Agostinho Agra; Cristina Requejo; Erick Delage (INFORMS J. Comput., 2021)

RMSA algorithms resilient to multiple node failures in dynamic EONs. - Fábio Barbosa; Amaro de Sousa; Agostinho Agra; Krzysztof Walkowiak; Róza Goscien (Opt. Switch. Netw., 2021)

Berth allocation and quay crane assignment/scheduling problem under uncertainty: A survey. - Filipe Rodrigues 002; Agostinho Agra (Eur. J. Oper. Res., 2022)

Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries. - Agostinho Agra; Marielle Christiansen; Laurence A. Wolsey (Eur. J. Oper. Res., 2022)

Weighted iterated local branching for mathematical programming problems with binary variables. - Filipe Rodrigues 002; Agostinho Agra; Lars Magnus Hvattum; Cristina Requejo (J. Heuristics, 2022)

The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem. - Mohamed Ben Ahmed; Lars Magnus Hvattum; Agostinho Agra (Comput. Oper. Res., 2023)

A robust model for the lot-sizing problem with uncertain demands. - Agostinho Agra (Optim. Lett., 2023)

Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third-party networks. - Fábio Barbosa; Amaro de Sousa; Agostinho Agra (Networks, 2023)

Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem. - Agostinho Agra; Cristina Requejo (EURO J. Comput. Optim., 2024)

A New Algorithm Framework for the Influence Maximization Problem Using Graph Clustering. - Agostinho Agra; Jose Maria Samuco (Inf., 2024)

Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model. - Filipe Rodrigues 002; Agostinho Agra (Int. Trans. Oper. Res., 2024)

Mixed-Integer Multi-objective Programming for Intermodal Supply Chain Design. - Marco Marto; Valentina Chkoniya; Eduardo B. Couto; Telmo Pinto 001; Marco S. Reis; Agostinho Agra (ICCSA (Workshops 3), 2025)

Two-stage distributionally robust optimization with a finite support. - Agostinho Agra (Comput. Oper. Res., 2025)

Pareto front for two-stage distributionally robust optimization problems. - Agostinho Agra; Filipe Rodrigues 002 (Eur. J. Oper. Res., 2025)