Agostinho Agra

According to our database1, Agostinho Agra authored at least 48 papers between 1999 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2021
Robust formulations for economic lot-sizing problem with remanufacturing.
Eur. J. 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

Robust inventory theory with perishable products.
Ann. Oper. Res., 2020

2019
Comparing techniques for modelling uncertainty in a maritime inventory routing problem.
Eur. J. Oper. Res., 2019

A computational comparison of compact MILP formulations for the zero forcing number.
Discret. Appl. Math., 2019

A RMSA Algorithm Resilient to Multiple Node Failures on Elastic Optical Networks.
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
Robust Optimization for a Maritime Inventory Routing Problem.
Transp. Sci., 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

The Design of Transparent Optical Networks Minimizing the Impact of Critical Nodes.
Electron. Notes Discret. Math., 2018

A hybrid heuristic for a stochastic production-inventory-routing problem.
Electron. Notes Discret. Math., 2018

Topology Design of Transparent Optical Networks Resilient to Multiple Node Failures.
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

The k-regular induced subgraph problem.
Discret. Appl. Math., 2017

A decomposition approach for the p-median problem on disconnected graphs.
Comput. Oper. Res., 2017

Combined ship routing and inventory management in the salmon farming industry.
Ann. Oper. Res., 2017

A Decomposition Algorithm for Robust Lot Sizing Problem with Remanufacturing Option.
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

A Dynamic Programming Approach for a Class of Robust Optimization Problems.
SIAM J. Optim., 2016

Implicit cover inequalities.
J. Comb. 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

Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem.
Proceedings of the Machine Learning, Optimization, and Big Data, 2016

A Branch-and-Cut Algorithm for a Multi-item Inventory Distribution Problem.
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
Valid inequalities for the single arc design problem with set-ups.
Discret. Optim., 2015

A maritime inventory routing problem with stochastic sailing and port times.
Comput. Oper. Res., 2015

2014
Facets for the single node fixed-charge network set with a node set-up variable.
Optim. Lett., 2014

Hybrid heuristics for a short sea inventory routing problem.
Eur. J. Oper. Res., 2014

2013
Mixed Integer Formulations for a Short Sea Fuel Oil Distribution Problem.
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

Intersecting a simple mixed integer set with a vertex packing set.
Electron. Notes Discret. Math., 2013

The robust vehicle routing problem with time windows.
Comput. Oper. Res., 2013

A new Branch and Bound method for a discrete truss topology design problem.
Comput. Optim. Appl., 2013

2012
Mixing polyhedra with two non divisible coefficients.
Math. Program., 2012

Layered Formulation for the Robust Vehicle Routing Problem with Time Windows.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Lot-sizing and scheduling in a glass container manufacture company.
Int. J. Math. Model. Numer. Optimisation, 2011

On the Weight-Constrained Minimum Spanning Tree Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

2009
Extended formulations for the cardinality constrained subtree of a tree problem.
Oper. Res. Lett., 2009

2007
Lifting two-integer knapsack inequalities.
Math. Program., 2007

2006
Polyhedral description of the integer single node flow set with constant bounds.
Math. Program., 2006

Description of 2-integer continuous knapsack polyhedra.
Discret. Optim., 2006

1999
Lotsizing with backlogging and start-ups: the case of Wagner-Whitin costs.
Oper. Res. Lett., 1999


  Loading...