default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIbrahim Muter
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j14]M. Hakan Akyüz
, Ibrahim Muter, Günes Erdogan, Gilbert Laporte:
Minimum cost delivery of multi-item orders in e-commerce logistics. Comput. Oper. Res. 138: 105613 (2022)- 2021
- [j13]Ethem Çanakoglu, Ibrahim Muter:
Identical parallel machine scheduling with discrete additional resource and an application in audit scheduling. Int. J. Prod. Res. 59(17): 5321-5336 (2021) - [j12]Ethem Çanakoglu, Ibrahim Muter, Tevfik Aytekin:
Integrating Individual and Aggregate Diversity in Top-N Recommendation. INFORMS J. Comput. 33(1): 300-318 (2021) - 2020
- [j11]Nursen Aydin, Ibrahim Muter, S. Ilker Birbil:
Multi-objective temporal bin packing problem: An application in cloud computing. Comput. Oper. Res. 121: 104959 (2020) - [j10]Ibrahim Muter:
Exact algorithms to minimize makespan on single and parallel batch processing machines. Eur. J. Oper. Res. 285(2): 470-483 (2020)
2010 – 2019
- 2018
- [j9]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) - [j8]Ibrahim Muter, Zeynep Sezer:
Algorithms for the one-dimensional two-stage cutting stock problem. Eur. J. Oper. Res. 271(1): 20-32 (2018) - 2017
- [j7]Ibrahim Muter, Tevfik Aytekin:
Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches. INFORMS J. Comput. 29(3): 405-421 (2017) - 2016
- [c2]Zeynep Sezer, Ibrahim Muter:
Two-Stage Cutting Stock Problem with Due Dates. OR 2016: 139-145 - [c1]Ethem Çanakoglu, Ibrahim Muter, Onur Adanur:
Audit Scheduling in Banking Sector. OR 2016: 499-505 - 2015
- [j6]Ibrahim Muter:
A new formulation and approach for the black and white traveling salesman problem. Comput. Oper. Res. 53: 96-106 (2015) - 2014
- [j5]Ibrahim Muter, Jean-François Cordeau, Gilbert Laporte:
A Branch-and-Price Algorithm for the Multidepot Vehicle Routing Problem with Interdepot Routes. Transp. Sci. 48(3): 425-441 (2014) - 2013
- [j4]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) - [j3]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) - 2012
- [j2]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) - 2010
- [j1]Ibrahim Muter, S. Ilker Birbil, Güvenç Sahin:
Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems. INFORMS J. Comput. 22(4): 603-619 (2010)
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-24 23:05 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:
