default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDÜmit Bilge
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j15]Mert Sahinkoç
, Ümit Bilge:
A reference set based many-objective co-evolutionary algorithm with an application to the knapsack problem. Eur. J. Oper. Res. 300(2): 405-417 (2022)- 2020
- [j14]Gökalp Erbeyoglu, Ümit Bilge:
A robust disaster preparedness model for effective and fair disaster response. Eur. J. Oper. Res. 280(2): 479-494 (2020)
2010 – 2019
- 2019
- [j13]Umut Besikci, Ümit Bilge, Gündüz Ulusoy:
Resource portfolio problem under relaxed resource dedication policy in multi-mode multi-project scheduling. Int. J. Math. Oper. Res. 14(4): 541-567 (2019) - 2018
- [j12]Mert Sahinkoç, Ümit Bilge:
Facility layout problem with QAP formulation under scenario-based uncertainty. INFOR Inf. Syst. Oper. Res. 56(4): 406-427 (2018) - 2017
- [j11]Erinç Albey, Ümit Bilge, Reha Uzsoy:
Multi-dimensional clearing functions for aggregate capacity modelling in multi-stage production systems. Int. J. Prod. Res. 55(14): 4164-4179 (2017) - 2016
- [j10]Gökalp Erbeyoglu, Ümit Bilge:
PSO-based and SA-based metaheuristics for bilinear programming problems: an application to the pooling problem. J. Heuristics 22(2): 147-179 (2016) - 2015
- [j9]Umut Besikci, Ümit Bilge, Gündüz Ulusoy:
Multi-mode resource constrained multi-project scheduling and resource portfolio problem. Eur. J. Oper. Res. 240(1): 22-31 (2015) - 2014
- [j8]Mehmet Basdere, Ümit Bilge:
Operational aircraft maintenance routing problem with remaining time consideration. Eur. J. Oper. Res. 235(1): 315-328 (2014) - 2011
- [j7]Funda Sivrikaya-Serifoglu, Ümit Bilge:
Guest editorial. Comput. Oper. Res. 38(1): 1-2 (2011)
2000 – 2009
- 2008
- [j6]Ümit Bilge, Murat Firat, Erinç Albey:
A parametric fuzzy logic approach to dynamic part routing under full routing flexibility. Comput. Ind. Eng. 55(1): 15-33 (2008) - 2007
- [j5]Ümit Bilge, Müjde Kurtulan, Furkan Kiraç:
A tabu search algorithm for the single machine total weighted tardiness problem. Eur. J. Oper. Res. 176(3): 1423-1435 (2007) - 2004
- [j4]Ümit Bilge, Furkan Kiraç, Müjde Kurtulan, Pelin Pekgün:
A tabu search algorithm for parallel machine total tardiness problem. Comput. Oper. Res. 31(3): 397-414 (2004)
1990 – 1999
- 1997
- [j3]Gündüz Ulusoy, Funda Sivrikaya-Serifoglu, Ümit Bilge:
A genetic algorithm approach to the simultaneous scheduling of machines and automated guided vehicles. Comput. Oper. Res. 24(4): 335-351 (1997) - [j2]Ümit Bilge, Gündüz Ulusoy:
Letter to the Editor. Oper. Res. 45(2): 322 (1997) - 1995
- [j1]Ümit Bilge, Gündüz Ulusoy:
A Time Window Approach to Simultaneous Scheduling of Machines and Material Handling System in an FMS. Oper. Res. 43(6): 1058-1070 (1995)
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-04-26 18:26 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:
