default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEvrim Ursavas
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Umur Hastürk
, Albert H. Schrotenboer, Evrim Ursavas, Kees Jan Roodbergen:
Stochastic Cyclic Inventory Routing with Supply Uncertainty: A Case in Green-Hydrogen Logistics. Transp. Sci. 58(2): 315-339 (2024)- 2022
- [j7]Evrim Ursavas:
Priority control of berth allocation problem in container terminals. Ann. Oper. Res. 317(2): 805-824 (2022) - [i4]Amin Maghami, Evrim Ursavas, Ashish Cherukuri:
A two-step approach to Wasserstein distributionally robust chance- and security-constrained dispatch. CoRR abs/2208.07642 (2022) - [i3]Albert H. Schrotenboer, Rob Wenneker, Evrim Ursavas, Stuart X. Zhu:
Robust Reserve-Crew Scheduling for Airlines. CoRR abs/2209.05108 (2022) - 2021
- [i2]Ilke Bakir, Murat Yildirim, Evrim Ursavas:
An Integrated Optimization Framework for Multi-Component Predictive Analytics in Wind Farm Operations & Maintenance. CoRR abs/2101.01084 (2021) - [i1]Arjen T. Veenstra, Albert H. Schrotenboer, Michiel A. J. uit het Broek, Evrim Ursavas:
Green Hydrogen Plant: Optimal control strategies for integrated hydrogen storage and power generation with wind energy. CoRR abs/2108.00530 (2021)
2010 – 2019
- 2019
- [j6]Albert H. Schrotenboer, Evrim Ursavas, Iris F. A. Vis:
A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems. Transp. Sci. 53(4): 1001-1022 (2019) - 2018
- [j5]Evrim Ursavas, Stuart X. Zhu:
Integrated Passenger and Freight Train Planning on Shared-Use Corridors. Transp. Sci. 52(6): 1376-1390 (2018) - 2017
- [j4]Evrim Ursavas:
A benders decomposition approach for solving the offshore wind farm installation planning at the North Sea. Eur. J. Oper. Res. 258(2): 703-714 (2017) - [c2]Claudia Caballini, Massimo Paolucci, Simona Sacone, Evrim Ursavas:
Towards the Physical Internet Paradigm: A Model for Transportation Planning in Complex Road Networks with Empty Return Optimization. ICCL 2017: 452-467 - 2016
- [j3]Marie-Anne Beens, Evrim Ursavas:
Scheduling cranes at an indented berth. Eur. J. Oper. Res. 253(2): 298-313 (2016) - [j2]Evrim Ursavas, Stuart X. Zhu:
Optimal policies for the berth allocation problem under stochastic nature. Eur. J. Oper. Res. 255(2): 380-387 (2016) - 2014
- [j1]Evrim Ursavas:
A decision support system for quayside operations in a container terminal. Decis. Support Syst. 59: 312-324 (2014) - 2011
- [c1]Evrim Ursavas Guldogan, Önder Bulut, Mehmet Fatih Tasgetiren:
A Dynamic Berth Allocation Problem with Priority Considerations under Stochastic Nature. ICIC (2) 2011: 74-82
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-07-05 20:19 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:
