default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAhmet B. Keha
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j13]Chengliang Zhang, George L. Nemhauser, Joel Sokol
, Myun-Seok Cheon, Ahmet B. Keha:
Flexible solutions to maritime inventory routing problems with delivery time windows. Comput. Oper. Res. 89: 153-162 (2018)- 2014
- [j12]Ketan Khowala, John W. Fowler, Ahmet B. Keha, Hari Balasubramanian:
Single machine scheduling with interfering job sets. Comput. Oper. Res. 45: 97-107 (2014) - [j11]Dimitri J. Papageorgiou, George L. Nemhauser, Joel S. Sokol, Myun-Seok Cheon, Ahmet B. Keha:
MIRPLib - A library of maritime inventory routing problem instances: Survey, core model, and benchmark results. Eur. J. Oper. Res. 235(2): 350-366 (2014) - [j10]Dimitri J. Papageorgiou, Ahmet B. Keha, George L. Nemhauser, Joel S. Sokol:
Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing. INFORMS J. Comput. 26(4): 825-847 (2014) - 2010
- [j9]Ahmet B. Keha, Tolga M. Duman:
Minimum distance computation of LDPC codes using a branch and cut algorithm. IEEE Trans. Commun. 58(4): 1072-1079 (2010)
2000 – 2009
- 2009
- [j8]Ahmet B. Keha, Ketan Khowala, John W. Fowler:
Mixed integer programming formulations for single machine scheduling problems. Comput. Ind. Eng. 56(1): 357-367 (2009) - [j7]Hari Balasubramanian, John W. Fowler, Ahmet B. Keha, Michele E. Pfund:
Scheduling interfering job sets on parallel machines. Eur. J. Oper. Res. 199(1): 55-67 (2009) - 2008
- [j6]Juan Pablo Vielma, Ahmet B. Keha, George L. Nemhauser:
Nonconvex, lower semicontinuous piecewise linear optimization. Discret. Optim. 5(2): 467-488 (2008) - [c1]Ahmet B. Keha, Tolga M. Duman:
A branch and cut algorithm for finding the minimum distance of a linear block code. ISIT 2008: 201-205 - 2007
- [j5]Rajesh Swaminathan, Michele E. Pfund, John W. Fowler, Scott J. Mason, Ahmet B. Keha:
Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times. Comput. Oper. Res. 34(10): 3055-3068 (2007) - [j4]Jeffrey D. Laub, John W. Fowler, Ahmet B. Keha:
Minimizing makespan with multiple-orders-per-job in a two-machine flowshop. Eur. J. Oper. Res. 182(1): 63-79 (2007) - 2006
- [j3]Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser:
A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization. Oper. Res. 54(5): 847-858 (2006) - 2004
- [j2]Ahmet B. Keha, Ismael R. de Farias Jr., George L. Nemhauser:
Models for representing piecewise linear cost functions. Oper. Res. Lett. 32(1): 44-48 (2004) - 2003
- [j1]Murat Köksalan, Ahmet B. Keha:
Using genetic algorithms for single-machine bicriteria scheduling problems. Eur. J. Oper. Res. 145(3): 543-556 (2003)
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 2025-01-09 13:02 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:
