default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFilipe Rodrigues 0002
Person information
- affiliation: University of Aveiro, Department of Mathematics, Portugal
Other persons with the same name
- Filipe Rodrigues — disambiguation page
- Filipe Rodrigues 0001
![[0000-0001-6979-6498]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-6979-6498")
— Technical University of Denmark, Department of Management Engineering, Kongens Lyngby, Denmark (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]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)- [j11]Filipe Rodrigues:
Improved sequential insertion heuristics for berth allocation problems. Int. Trans. Oper. Res. 31(3): 1585-1608 (2024) - 2022
- [j10]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) - [j9]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
- [j8]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) - [j7]Filipe Rodrigues, Agostinho Agra, Lars Magnus Hvattum, Cristina Requejo:
Weighted proximity search. J. Heuristics 27(3): 459-496 (2021) - [j6]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)
2010 – 2019
- 2019
- [j5]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) - [j4]Filipe Rodrigues, Cristina Requejo:
Suppliers selection problem with quantity discounts and price changes: A heuristic approach. RAIRO Oper. Res. 53(3): 887-901 (2019) - 2018
- [j3]Agostinho Agra, Cristina Requejo, Filipe Rodrigues:
A hybrid heuristic for a stochastic production-inventory-routing problem. Electron. Notes Discret. Math. 64: 345-354 (2018) - [j2]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) - [j1]Agostinho Agra, Marielle Christiansen, Lars Magnus Hvattum, Filipe Rodrigues:
Robust Optimization for a Maritime Inventory Routing Problem. Transp. Sci. 52(3): 509-525 (2018) - 2016
- [c1]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
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-10-07 22:16 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:
