default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKerem Bülbül
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j20]Kerem Bülbül
, Nilay Noyan, Hazal Erol:
Multi-stage stochastic programming models for provisioning cloud computing resources. Eur. J. Oper. Res. 288(3): 886-901 (2021)
2010 – 2019
- 2019
- [j19]Kerem Bülbül, Safia Kedad-Sidhoum, Halil Sen:
Single-machine common due date total earliness/tardiness scheduling with machine unavailability. J. Sched. 22(5): 543-565 (2019) - 2018
- [j18]Özgün Elçi, Nilay Noyan, Kerem Bülbül:
Chance-constrained stochastic programming under variable reliability levels with an application to humanitarian relief network design. Comput. Oper. Res. 96: 91-107 (2018) - [j17]Ibrahim Muter, S. Ilker Birbil, Kerem Bülbül:
Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows. Eur. J. Oper. Res. 264(1): 29-45 (2018) - [j16]Reinhard Bürgy, Kerem Bülbül:
The job shop scheduling problem with convex costs. Eur. J. Oper. Res. 268(1): 82-100 (2018) - 2017
- [j15]Semih Atakan, Kerem Bülbül, Nilay Noyan:
Minimizing value-at-risk in single-machine scheduling. Ann. Oper. Res. 248(1-2): 25-73 (2017) - [j14]Kerem Bülbül, Halil Sen:
An exact extended formulation for the unrelated parallel machine total weighted completion time problem. J. Sched. 20(4): 373-389 (2017) - 2016
- [j13]Belma Yelbay, S. Ilker Birbil, Kerem Bülbül, Hasan M. Jamil:
Approximating the minimum hub cover problem on planar graphs. Optim. Lett. 10(1): 33-45 (2016) - 2015
- [j12]Halil Sen, Kerem Bülbül:
A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines. INFORMS J. Comput. 27(1): 135-150 (2015) - 2014
- [c3]M. Berke Pamay, Kerem Bülbül, Gündüz Ulusoy:
Dynamic Resource Constrained Multi-Project Scheduling Problem with Weighted Earliness/Tardiness Costs. Essays in Production, Project Planning and Scheduling 2014: 219-247 - 2013
- [j11]Ibrahim Muter, S. Ilker Birbil, Kerem Bülbül, Güvenç Sahin, Hüsnü Yenigün, Duygu Tas, Dilek Tüzün:
Solving a robust airline crew pairing problem with column generation. Comput. Oper. Res. 40(3): 815-830 (2013) - [j10]Ibrahim Muter, S. Ilker Birbil, Kerem Bülbül:
Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows. Math. Program. 142(1-2): 47-82 (2013) - [j9]Kerem Bülbül, Philip M. Kaminsky:
A linear programming-based method for job shop scheduling. J. Sched. 16(2): 161-183 (2013) - [i1]Belma Yelbay, S. Ilker Birbil, Kerem Bülbül, Hasan M. Jamil:
Trade-offs Computing Minimum Hub Cover toward Optimized Graph Query Processing. CoRR abs/1311.1626 (2013) - 2012
- [j8]Ibrahim Muter, S. Ilker Birbil, Kerem Bülbül, Güvenç Sahin:
A note on "A LP-based heuristic for a time-constrained routing problem". Eur. J. Oper. Res. 221(2): 306-307 (2012) - 2011
- [j7]Kerem Bülbül:
A hybrid shifting bottleneck-tabu search heuristic for the job shop total weighted tardiness problem. Comput. Oper. Res. 38(6): 967-983 (2011)
2000 – 2009
- 2009
- [j6]Hatice Tekiner, S. Ilker Birbil, Kerem Bülbül:
Robust crew pairing for managing extra flights. Comput. Oper. Res. 36(6): 2031-2048 (2009) - [j5]Serkan Çiftlikli, Figen Öztoprak, Özgür Erçetin, Kerem Bülbül:
Distributed Algorithms for Delay Bounded Minimum Energy Wireless Broadcasting. Int. J. Interdiscip. Telecommun. Netw. 1(2): 46-65 (2009) - [j4]Kerem Bülbül, Özgür Erçetin, Tonguç Ünlüyurt:
Hop Constrained Energy-Efficient Broadcasting: Insights from Massively Dense Ad Hoc Networks. IEEE Trans. Mob. Comput. 8(2): 188-202 (2009) - 2007
- [j3]Kerem Bülbül, Özgür Erçetin:
Wireless Systems Maximum precision-lifetime curve for joint sensor selection and data routing in sensor networks. Eur. Trans. Telecommun. 18(7): 815-823 (2007) - [j2]Özgür Erçetin, Özgür Gürbüz, Kerem Bülbül, Ertugrul Necdet Ciftcioglu, Aylin Aksu:
A Practical Routing and MAC Framework for Maximum Lifetime Sensor Telemetry. IEICE Trans. Commun. 90-B(11): 3146-3157 (2007) - [j1]Kerem Bülbül, Philip M. Kaminsky, Candace A. Yano:
Preemption in single machine earliness/tardiness scheduling. J. Sched. 10(4-5): 271-292 (2007) - [c2]Kerem Bülbül, Özgür Erçetin, Tonguç Ünlüyurt:
Delay Constrained Minimum Power Broadcasting in Wireless Networks. WiOpt 2007: 1-9 - 2005
- [c1]Özgür Erçetin, Özgür Gürbüz, Kerem Bülbül, Aylin Aksu:
Joint Sensor Selection and Data Routing in Sensor Networks. NETWORKING 2005: 828-839 - [p2]Aylin Aksu, Özgür Erçetin, Tonguç Ünlüyurt, Kerem Bülbül, K. Kilic:
Energy Efficient and Reliable Routing with Cooperative Diversity in Wireless Ad-Hoc Networks. New Trends in Computer Networks 2005 - [p1]O. Erhun Kundakcioglu, Kerem Bülbül, Tonguç Ünlüyurt, K. Kilic, Özgür Erçetin:
Minimum Power Multicasting with delay Bound Constraints in Ad Hoc Wireless Networks. New Trends in Computer Networks 2005
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-12-26 00:49 CET 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:
