default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMehmet A. Begen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Mehmet A. Begen
, Fredrik Ødegaard, Jafar Sadeghi:
Intra-provincial benchmark analysis of COVID-19 in Canada. INFOR Inf. Syst. Oper. Res. 62(3): 377-418 (2024)- [j11]Christos Zacharias, Nan Liu, Mehmet A. Begen:
Dynamic Interday and Intraday Scheduling. Oper. Res. 72(1): 317-335 (2024) - 2023
- [j10]Jafar Sadeghi, Mehmet A. Begen, Fredrik Ødegaard:
Refined bounds for the non-Archimedean ϵ in DEA. Comput. Oper. Res. 154: 106163 (2023) - 2022
- [j9]Bahman Naderi, Mehmet A. Begen, Gregory S. Zaric:
Type-2 integrated process-planning and scheduling problem: Reformulation and solution algorithms. Comput. Oper. Res. 142: 105728 (2022) - [j8]Burcu Caglar Gencosman, Mehmet A. Begen:
Exact optimization and decomposition approaches for shelf space allocation. Eur. J. Oper. Res. 299(2): 432-447 (2022) - 2021
- [j7]Peijun Sang, Mehmet A. Begen, Jiguo Cao:
Appointment scheduling with a quantile objective. Comput. Oper. Res. 132: 105295 (2021) - 2020
- [j6]Antoine Sauré, Mehmet A. Begen, Jonathan Patrick:
Dynamic multi-priority, multi-class patient scheduling with stochastic service times. Eur. J. Oper. Res. 280(1): 254-265 (2020)
2010 – 2019
- 2018
- [j5]John S. F. Lyons, Peter C. Bell, Mehmet A. Begen:
Solving the Whistler-Blackcomb Mega Day Challenge. Interfaces 48(4): 323-339 (2018) - 2017
- [j4]Onur Ozturk, Mehmet A. Begen, Gregory S. Zaric:
A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan. Int. J. Prod. Res. 55(6): 1815-1831 (2017) - 2014
- [j3]Onur Ozturk, Mehmet A. Begen, Gregory S. Zaric:
A branch and bound based heuristic for makespan minimization of washing operations in hospital sterilization services. Eur. J. Oper. Res. 239(1): 214-226 (2014) - 2012
- [j2]Mehmet A. Begen, Retsef Levi, Maurice Queyranne:
Technical Note - A Sampling-Based Approach to Appointment Scheduling. Oper. Res. 60(3): 675-681 (2012) - 2011
- [j1]Mehmet A. Begen, Maurice Queyranne:
Appointment Scheduling with Discrete Random Durations. Math. Oper. Res. 36(2): 240-257 (2011)
2000 – 2009
- 2009
- [c5]Mehmet A. Begen, Maurice Queyranne:
Appointment scheduling with discrete random durations. SODA 2009: 845-854 - 2006
- [c4]Ali C. Begen, Mehmet A. Begen, Yucel Altunbasak, M. Reha Civanlar:
Proxy Selection for Interactive Video. ICC 2006: 878-883 - [c3]Ali C. Begen, Mehmet A. Begen, Yucel Altunbasak:
Predictive Modeling of Video Packet Delay in IP Networks. ICIP 2006: 1325-1328 - 2003
- [c2]Ali C. Begen, Yucel Altunbasak, Mehmet A. Begen:
Rate-distortion optimized on-demand media streaming with server diversity. ICIP (3) 2003: 657-660 - [c1]Ali C. Begen, Yucel Altunbasak, Özlem Ergun, Mehmet A. Begen:
Real-Time Multiple Description and Layered Encoded Video Streaming with Optimal Diverse Routing. ISCC 2003: 887-892
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 21:24 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:
