default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAgostinho Agra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j52]Agostinho Agra
, Cristina Requejo:
Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the p-median problem. EURO J. Comput. Optim. 12: 100081 (2024)- [j51]Agostinho Agra, Jose Maria Samuco:
A New Algorithm Framework for the Influence Maximization Problem Using Graph Clustering. Inf. 15(2): 112 (2024) - [j50]Filipe Rodrigues, Agostinho Agra:
Handling uncertainty in the quay crane scheduling problem: a unified distributionally robust decision model. Int. Trans. Oper. Res. 31(2): 721-748 (2024) - 2023
- [j49]Mohamed Ben Ahmed, Lars Magnus Hvattum, Agostinho Agra:
The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem. Comput. Oper. Res. 155: 106232 (2023) - [j48]Fábio Barbosa, Amaro de Sousa, Agostinho Agra:
Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third-party networks. Networks 82(2): 87-110 (2023) - [j47]Agostinho Agra:
A robust model for the lot-sizing problem with uncertain demands. Optim. Lett. 17(6): 1279-1293 (2023) - 2022
- [j46]Agostinho Agra, Marielle Christiansen, Laurence A. Wolsey:
Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries. Eur. J. Oper. Res. 297(1): 164-179 (2022) - [j45]Filipe Rodrigues, Agostinho Agra:
Berth allocation and quay crane assignment/scheduling problem under uncertainty: A survey. Eur. J. Oper. Res. 303(2): 501-524 (2022) - [j44]Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo:
Weighted iterated local branching for mathematical programming problems with binary variables. J. Heuristics 28(3): 329-350 (2022) - 2021
- [j43]Fábio Barbosa, Agostinho Agra, Amaro de Sousa:
The minimum cost network upgrade problem with maximum robustness to multiple node failures. Comput. Oper. Res. 136: 105453 (2021) - [j42]Öykü Naz Attila, Agostinho Agra, Kerem Akartunali, Ashwin Arulselvan:
Robust formulations for economic lot-sizing problem with remanufacturing. Eur. J. Oper. Res. 288(2): 496-510 (2021) - [j41]Filipe Rodrigues, Agostinho Agra:
An exact robust approach for the integrated berth allocation and quay crane scheduling problem under uncertain arrival times. Eur. J. Oper. Res. 295(2): 499-516 (2021) - [j40]Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo:
Weighted proximity search. J. Heuristics 27(3): 459-496 (2021) - [j39]Filipe Rodrigues, Agostinho Agra, Cristina Requejo, Erick Delage:
Lagrangian Duality for Robust Problems with Decomposable Functions: The Case of a Robust Inventory Problem. INFORMS J. Comput. 33(2): 685-705 (2021) - [j38]Fábio Barbosa, Amaro de Sousa, Agostinho Agra, Krzysztof Walkowiak, Róza Goscien:
RMSA algorithms resilient to multiple node failures in dynamic EONs. Opt. Switch. Netw. 42: 100633 (2021) - 2020
- [j37]Marcio Costa Santos, Agostinho Agra, Michael Poss:
Robust inventory theory with perishable products. Ann. Oper. Res. 289(2): 473-494 (2020) - [j36]Luis Ernesto Flores Luyo, Agostinho Agra, Rosa Figueiredo, Eladio Ocaña Anaya:
Mixed integer formulations for a routing problem with information collection in wireless networks. Eur. J. Oper. Res. 280(2): 621-638 (2020) - [j35]Luis Ernesto Flores Luyo, Agostinho Agra, Rosa Figueiredo, Eladio Ocaña Anaya:
Heuristics for a vehicle routing problem with information collection in wireless networks. J. Heuristics 26(2): 187-217 (2020) - [j34]Fabio Barbosa, Amaro de Sousa, Agostinho Agra:
Design/upgrade of a transparent optical network topology resilient to the simultaneous failure of its critical nodes. Networks 75(4): 356-373 (2020)
2010 – 2019
- 2019
- [j33]Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo:
A computational comparison of compact MILP formulations for the zero forcing number. Discret. Appl. Math. 269: 169-183 (2019) - [j32]Filipe Rodrigues, Agostinho Agra, Marielle Christiansen, Lars Magnus Hvattum, Cristina Requejo:
Comparing techniques for modelling uncertainty in a maritime inventory routing problem. Eur. J. Oper. Res. 277(3): 831-845 (2019) - [c10]Fabio Barbosa, Amaro de Sousa, Agostinho Agra:
Evaluation and Design of Elastic Optical Networks Resilient to Multiple Node Failures. DRCN 2019: 154-161 - [c9]Luis Ernesto Flores Luyo, Agostinho Agra, Rosa Figueiredo, Eitan Altman, Eladio Ocaña Anaya:
Vehicle Routing Problem for Information Collection in Wireless Networks. ICORES 2019: 157-168 - [c8]Fabio Barbosa, Amaro de Sousa, Agostinho Agra, Krzysztof Walkowiak, Róza Goscien:
A RMSA Algorithm Resilient to Multiple Node Failures on Elastic Optical Networks. RNDM 2019: 1-8 - 2018
- [j31]Fabio Barbosa, Amaro de Sousa, Agostinho Agra:
The Design of Transparent Optical Networks Minimizing the Impact of Critical Nodes. Electron. Notes Discret. Math. 64: 165-174 (2018) - [j30]Agostinho Agra, Cristina Requejo, Filipe Rodrigues:
A hybrid heuristic for a stochastic production-inventory-routing problem. Electron. Notes Discret. Math. 64: 345-354 (2018) - [j29]Agostinho Agra, Maryse Oliveira:
MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem. Eur. J. Oper. Res. 264(1): 138-148 (2018) - [j28]Agostinho Agra, Cristina Requejo, Filipe Rodrigues:
An adjustable sample average approximation algorithm for the stochastic production-inventory-routing problem. Networks 72(1): 5-24 (2018) - [j27]Agostinho Agra, Marielle Christiansen, Lars Magnus Hvattum, Filipe Rodrigues:
Robust Optimization for a Maritime Inventory Routing Problem. Transp. Sci. 52(3): 509-525 (2018) - [c7]Fabio Barbosa, Amaro de Sousa, Agostinho Agra:
Topology Design of Transparent Optical Networks Resilient to Multiple Node Failures. RNDM 2018: 1-8 - 2017
- [j26]Agostinho Agra, Marielle Christiansen, Kristine S. Ivarsøy, Ida Elise Solhaug, Asgeir Tomasgard:
Combined ship routing and inventory management in the salmon farming industry. Ann. Oper. Res. 253(2): 799-823 (2017) - [j25]Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo:
A decomposition approach for the p-median problem on disconnected graphs. Comput. Oper. Res. 86: 79-85 (2017) - [j24]Agostinho Agra, Geir Dahl, Torkel Andreas Haufmann, Sofia J. Pinheiro:
The k-regular induced subgraph problem. Discret. Appl. Math. 222: 14-30 (2017) - [j23]Agostinho Agra, Rosa Figueiredo, Carlile Lavor, Nelson Maculan, António Pereira, Cristina Requejo:
Feasibility check for the distance geometry problem: an application to molecular conformations. Int. Trans. Oper. Res. 24(5): 1023-1040 (2017) - [c6]Öykü Naz Attila, Agostinho Agra, Kerem Akartunali, Ashwin Arulselvan:
A Decomposition Algorithm for Robust Lot Sizing Problem with Remanufacturing Option. ICCSA (2) 2017: 684-695 - 2016
- [j22]Agostinho Agra, Mahdi Doostmohammadi, Cid C. de Souza:
Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph. Discret. Optim. 21: 42-70 (2016) - [j21]Agostinho Agra, Miguel Fragoso Constantino:
Lifted Euclidean inequalities for the integer single node flow set with upper bounds. Eur. J. Oper. Res. 251(1): 53-63 (2016) - [j20]Agostinho Agra, Cristina Requejo, Eulália Santos:
Implicit cover inequalities. J. Comb. Optim. 31(3): 1111-1129 (2016) - [j19]Agostinho Agra, Marcio Costa Santos, Dritan Nace, Michael Poss:
A Dynamic Programming Approach for a Class of Robust Optimization Problems. SIAM J. Optim. 26(3): 1799-1823 (2016) - [j18]Agostinho Agra, Amaro de Sousa, Mahdi Doostmohammadi:
The Minimum Cost Design of Transparent Optical Networks Combining Grooming, Routing, and Wavelength Assignment. IEEE/ACM Trans. Netw. 24(6): 3702-3713 (2016) - [c5]Agostinho Agra, Marielle Christiansen, Lars Magnus Hvattum, Filipe Rodrigues:
A MIP Based Local Search Heuristic for a Stochastic Maritime Inventory Routing Problem. ICCL 2016: 18-34 - [c4]Agostinho Agra, Adelaide Cerveira, Cristina Requejo:
A Branch-and-Cut Algorithm for a Multi-item Inventory Distribution Problem. MOD 2016: 144-158 - [c3]Agostinho Agra, Adelaide Cerveira, Cristina Requejo:
Lagrangian Relaxation Bounds for a Production-Inventory-Routing Problem. MOD 2016: 236-245 - 2015
- [j17]Agostinho Agra, Marielle Christiansen, Alexandrino Delgado, Lars Magnus Hvattum:
A maritime inventory routing problem with stochastic sailing and port times. Comput. Oper. Res. 61: 18-30 (2015) - [j16]Agostinho Agra, Mahdi Doostmohammadi, Quentin Louveaux:
Valid inequalities for the single arc design problem with set-ups. Discret. Optim. 16: 17-35 (2015) - 2014
- [j15]Agostinho Agra, Marielle Christiansen, Alexandrino Delgado, Luidi Simonetti:
Hybrid heuristics for a short sea inventory routing problem. Eur. J. Oper. Res. 236(3): 924-935 (2014) - [j14]Agostinho Agra, Mahdi Doostmohammadi:
Facets for the single node fixed-charge network set with a node set-up variable. Optim. Lett. 8(4): 1501-1515 (2014) - 2013
- [j13]Adelaide Cerveira, Agostinho Agra, Fernando Bastos, Joaquim A. S. Gromicho:
A new Branch and Bound method for a discrete truss topology design problem. Comput. Optim. Appl. 54(1): 163-187 (2013) - [j12]Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo:
The robust vehicle routing problem with time windows. Comput. Oper. Res. 40(3): 856-866 (2013) - [j11]Agostinho Agra, Mahdi Doostmohammadi, Cid Carvalho de Souza:
Intersecting a simple mixed integer set with a vertex packing set. Electron. Notes Discret. Math. 41: 327-334 (2013) - [j10]Agostinho Agra, Jorge Orestes Cerdeira, Cristina Requejo:
Using decomposition to improve greedy solutions of the optimal diversity management problem. Int. Trans. Oper. Res. 20(5): 617-625 (2013) - [j9]Agostinho Agra, Henrik Andersson, Marielle Christiansen, Laurence A. Wolsey:
A maritime inventory routing problem: Discrete time formulations and valid inequalities. Networks 62(4): 297-314 (2013) - [j8]Agostinho Agra, Marielle Christiansen, Alexandrino Delgado:
Mixed Integer Formulations for a Short Sea Fuel Oil Distribution Problem. Transp. Sci. 47(1): 108-124 (2013) - 2012
- [j7]Agostinho Agra, Miguel Fragoso Constantino:
Mixing polyhedra with two non divisible coefficients. Math. Program. 135(1-2): 45-87 (2012) - [c2]Agostinho Agra, Marielle Christiansen, Rosa M. V. Figueiredo, Lars Magnus Hvattum, Michael Poss, Cristina Requejo:
Layered Formulation for the Robust Vehicle Routing Problem with Time Windows. ISCO 2012: 249-260 - 2011
- [j6]Agostinho Agra, Catarina P. Avelino, Adelaide Cerveira, Alexandrino Delgado, Michael Poss:
Lot-sizing and scheduling in a glass container manufacture company. Int. J. Math. Model. Numer. Optimisation 2(3): 253-272 (2011) - [c1]Agostinho Agra, Adelaide Cerveira, Cristina Requejo, Eulália Santos:
On the Weight-Constrained Minimum Spanning Tree Problem. INOC 2011: 156-161
2000 – 2009
- 2009
- [j5]Agostinho Agra, Luis Eduardo Neves Gouveia, Cristina Requejo:
Extended formulations for the cardinality constrained subtree of a tree problem. Oper. Res. Lett. 37(3): 192-196 (2009) - 2007
- [j4]Agostinho Agra, Miguel Fragoso Constantino:
Lifting two-integer knapsack inequalities. Math. Program. 109(1): 115-154 (2007) - 2006
- [j3]Agostinho Agra, Miguel Fragoso Constantino:
Description of 2-integer continuous knapsack polyhedra. Discret. Optim. 3(2): 95-110 (2006) - [j2]Agostinho Agra, Miguel Fragoso Constantino:
Polyhedral description of the integer single node flow set with constant bounds. Math. Program. 105(2-3): 345-364 (2006)
1990 – 1999
- 1999
- [j1]Agostinho Agra, Miguel Fragoso Constantino:
Lotsizing with backlogging and start-ups: the case of Wagner-Whitin costs. Oper. Res. Lett. 25(2): 81-88 (1999)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-23 18:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
