default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNalan Gülpinar
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Nursen Aydin, Nalan Gülpinar, Yijun Zheng:
Dynamic capacity allotment planning for airlines via travel agencies. Comput. Oper. Res. 170: 106740 (2024)- 2023
- [j21]Gökalp Erbeyoglu, Nalan Gülpinar, Xuan Vinh Doan:
Dynamic surgery management under uncertainty. Eur. J. Oper. Res. 309(2): 832-844 (2023) - 2021
- [j20]Arne Strauss, Nalan Gülpinar, Yijun Zheng:
Dynamic pricing of flexible time slots for attended home delivery. Eur. J. Oper. Res. 294(3): 1022-1041 (2021)
2010 – 2019
- 2019
- [j19]Xin Fei
, Nalan Gülpinar, Jürgen Branke:
Efficient solution selection for two-stage stochastic programs. Eur. J. Oper. Res. 277(3): 918-929 (2019) - [j18]Xin Fei, Jürgen Branke, Nalan Gülpinar:
New Sampling Strategies When Searching for Robust Solutions. IEEE Trans. Evol. Comput. 23(2): 273-287 (2019) - 2018
- [j17]Nalan Gülpinar, Ethem Çanakoglu, Jürgen Branke:
Heuristics for the stochastic dynamic task-resource allocation problem with retry opportunities. Eur. J. Oper. Res. 266(1): 291-303 (2018) - 2017
- [j16]Nalan Gülpinar, Arne Strauss, Vinh Doan:
Preface: Applied Mathematical Optimization and Modelling (APMOD 2014). Ann. Oper. Res. 256(1): 1-2 (2017) - [j15]Nalan Gülpinar, Ethem Çanakoglu:
Robust portfolio selection problem under temperature uncertainty. Eur. J. Oper. Res. 256(2): 500-523 (2017) - 2016
- [j14]Nalan Gülpinar, Dessislava Pachamanova, Ethem Çanakoglu:
A robust asset-liability management framework for investment products with guarantees. OR Spectr. 38(4): 1007-1041 (2016) - 2014
- [j13]Nalan Gülpinar, Fernando S. Oliveira:
Analysis of relationship between forward and spot markets in oligopolies under demand and cost uncertainties. Comput. Manag. Sci. 11(3): 267-283 (2014) - [j12]Nalan Gülpinar, Ethem Çanakoglu, Dessislava Pachamanova:
Robust investment decisions under supply disruption in petroleum markets. Comput. Oper. Res. 44: 75-91 (2014) - 2013
- [j11]Nalan Gülpinar, Dessislava Pachamanova, Ethem Çanakoglu:
Robust strategies for facility location under uncertainty. Eur. J. Oper. Res. 225(1): 21-35 (2013) - 2010
- [j10]Nalan Gülpinar, Ethem Çanakoglu, Jo Thoms:
Robust team decision-making under uncertainty. Int. J. Appl. Decis. Sci. 3(3): 206-220 (2010)
2000 – 2009
- 2008
- [j9]Maria A. Osorio, Nalan Gülpinar, Berç Rustem:
A general framework for multistage mean-variance post-tax optimization. Ann. Oper. Res. 157(1): 3-23 (2008) - [j8]Maria A. Osorio, Nalan Gülpinar, Berç Rustem:
A mixed integer programming model for multistage mean-variance post-tax optimization. Eur. J. Oper. Res. 185(2): 451-480 (2008) - 2007
- [j7]Nalan Gülpinar, Uli Harder, Peter G. Harrison, Tony Field, Berç Rustem, Louis-François Pau:
Mean-variance performance optimization of response time in a tandem router network with batch arrivals. Clust. Comput. 10(2): 203-216 (2007) - [j6]Nalan Gülpinar, Berç Rustem:
Robust optimal decisions with imprecise forecasts. Comput. Stat. Data Anal. 51(7): 3595-3611 (2007) - [j5]Nalan Gülpinar, Berç Rustem:
Worst-case robust decisions for multi-period mean-variance portfolio optimization. Eur. J. Oper. Res. 183(3): 981-1000 (2007) - 2006
- [c7]Nalan Gülpinar, Berç Rustem:
Worst-case Optimal Robust Decisions for Multi-period Mean-Variance Portfolio Optimization. IMECS 2006: 985-985 - [c6]Nalan Gülpinar, Peter G. Harrison, Berç Rustem, Louis-François Pau:
Performance Optimization of a Tandem Router Network Using a Fluid Model. IMECS 2006: 986-986 - [c5]Nalan Gülpinar, Peter G. Harrison, Berç Rustem:
Worst-Case Analysis of Router Networks with Rival Queueing Models. ISCIS 2006: 897-907 - [c4]Nalan Gülpinar, Peter G. Harrison:
Optimization of a tandem router network using a fluid model. MSWiM 2006: 199-206 - [c3]Nalan Gülpinar, Peter G. Harrison, Berç Rustem, Louis-François Pau:
Performance Optimization of Mean Response Time in a Tandem Router Network with Batch Arrivals. NOMS 2006 - 2005
- [c2]Nalan Gülpinar, Peter G. Harrison, Berç Rustem, Louis-François Pau:
Optimization of a Tandem M/GI/1 Router Network with Batch Arrivals. IPDPS 2005 - 2004
- [j4]Nalan Gülpinar, Gregory Z. Gutin, Gautam Mitra, Alexei E. Zverovitch:
Extracting pure network submatrices in linear programs using signed graphs. Discret. Appl. Math. 137(3): 359-372 (2004) - [j3]Maria A. Osorio, Nalan Gülpinar, Berç Rustem, Reuben Settergren:
Post-tax optimization with stochastic programming. Eur. J. Oper. Res. 157(1): 152-168 (2004) - [c1]Nalan Gülpinar, Peter G. Harrison, Berç Rustem, Louis-François Pau:
An Optimisation Model for a Two-Node Router Network. MASCOTS 2004: 147-156 - 2002
- [j2]Nalan Gülpinar, Gautam Mitra, István Maros:
Creating Advanced Bases For Large Scale Linear Programs Exploiting Embedded Network Structure. Comput. Optim. Appl. 21(1): 71-93 (2002) - 2000
- [j1]Nalan Gülpinar, Gregory Z. Gutin, Gautam Mitra, István Maros:
Detecting Embedded Networks in LP Using GUB Structures and Independent Set Algorithms. Comput. Optim. Appl. 15(3): 235-247 (2000)
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-27 17:30 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:
