default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHaldun Aytug
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c2]Anurag Garg, Soohyun Cho, Haldun Aytug:
Bidding on Keyword Auctions: Advertiser's Perspective. ICIS 2021
2010 – 2019
- 2016
- [j30]Juheng Zhang
, Haldun Aytug:
Comparison of imputation methods for discriminant analysis with strategically hidden data. Eur. J. Oper. Res. 255(2): 522-530 (2016) - 2015
- [j29]Haldun Aytug:
Feature selection for support vector machines using Generalized Benders Decomposition. Eur. J. Oper. Res. 244(1): 210-218 (2015) - 2014
- [j28]Juheng Zhang, Haldun Aytug, Gary J. Koehler:
Research Note - Discriminant Analysis with Strategically Manipulated Data. Inf. Syst. Res. 25(3): 654-662 (2014) - 2012
- [j27]Haldun Aytug, Serpil Sayin:
Exploring the trade-off between generalization and empirical errors in a one-norm SVM. Eur. J. Oper. Res. 218(3): 667-675 (2012) - 2010
- [j26]Fidan Boylu, Haldun Aytug, Gary J. Koehler:
Induction over Strategic Agents: a genetic algorithm solution. Ann. Oper. Res. 174(1): 135-146 (2010) - [j25]Mark Cecchini, Haldun Aytug, Gary J. Koehler, Praveen Pathak:
Making words work: Using financial text as a predictor of financial events. Decis. Support Syst. 50(1): 164-175 (2010) - [j24]Fidan Boylu, Haldun Aytug, Gary J. Koehler:
Induction over constrained strategic agents. Eur. J. Oper. Res. 203(3): 698-705 (2010) - [j23]Fidan Boylu, Haldun Aytug, Gary J. Koehler:
Induction over Strategic Agents. Inf. Syst. Res. 21(1): 170-189 (2010) - [j22]Fidan Boylu, Haldun Aytug, Gary J. Koehler:
Data mining with agent gaming. Inf. Technol. Manag. 11(1): 1-6 (2010) - [j21]Ling He, Haldun Aytug, Gary J. Koehler:
Disclosure Control of Confidential Data by Applying Pac Learning Theory. J. Database Manag. 21(4): 111-123 (2010) - [j20]Mark Cecchini, Haldun Aytug, Gary J. Koehler, Praveen Pathak:
Detecting Management Fraud in Public Companies. Manag. Sci. 56(7): 1146-1160 (2010)
2000 – 2009
- 2009
- [j19]Enes Eryarsoy, Gary J. Koehler, Haldun Aytug:
Using domain-specific knowledge in generalization error bounds for support vector machine learning. Decis. Support Syst. 46(2): 481-491 (2009) - [j18]Fidan Boylu, Haldun Aytug, Gary J. Koehler:
Principal-agent learning. Decis. Support Syst. 47(2): 75-81 (2009) - [j17]Haldun Aytug, Serpil Sayin:
Using support vector machines to learn the efficient set in multiple objective discrete optimization. Eur. J. Oper. Res. 193(2): 510-519 (2009) - 2008
- [j16]Haldun Aytug, Gary J. Koehler, Ling He:
Risk Minimization and Minimum Description for Linear Discriminant Functions. INFORMS J. Comput. 20(2): 317-331 (2008) - [j15]Fidan Boylu, Haldun Aytug, Gary J. Koehler:
Systems for strategic learning. Inf. Syst. E Bus. Manag. 6(2): 205-220 (2008) - [j14]Nihat Kasap, Haldun Aytug, Anand A. Paul:
Erratum to "Minimizing makespan on a single machine subject to random breakdowns": [Oper. Res. Letters 34 (2006) 29-36]. Oper. Res. Lett. 36(1): 140 (2008) - 2007
- [j13]Nihat Kasap, Haldun Aytug, S. Selçuk Erengüç:
Provider selection and task allocation issues in networks with different QoS levels and all you can send pricing. Decis. Support Syst. 43(2): 375-389 (2007) - [j12]Haldun Aytug, Gary J. Koehler:
The effect of multiple optima on the simple GA run-time complexity. Eur. J. Oper. Res. 178(1): 27-45 (2007) - 2006
- [j11]Nihat Kasap, Haldun Aytug, Anand A. Paul:
Minimizing makespan on a single machine subject to random breakdowns. Oper. Res. Lett. 34(1): 29-36 (2006) - [j10]Christopher D. Geiger, Reha Uzsoy, Haldun Aytug:
Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach. J. Sched. 9(1): 7-34 (2006) - [c1]Haldun Aytug, Fidan Boylu, Gary J. Koehler:
Learning in the Presence of Self-Interested Agents. HICSS 2006 - 2005
- [j9]Haldun Aytug, Mark A. Lawley, Kenneth McKay, Shantha Mohan, Reha Uzsoy:
Executing production schedules in the face of uncertainties: A review and some future directions. Eur. J. Oper. Res. 161(1): 86-110 (2005) - 2004
- [j8]Vince Osisek, Haldun Aytug:
Discovering subproblem prioritization rules for shifting bottleneck algorithms. J. Intell. Manuf. 15(1): 55-67 (2004) - 2002
- [j7]Haldun Aytug, Cem Saydam:
Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study. Eur. J. Oper. Res. 141(3): 480-494 (2002) - 2000
- [j6]Haldun Aytug, Gary J. Koehler:
New stopping criterion for genetic algorithms. Eur. J. Oper. Res. 126(3): 662-674 (2000)
1990 – 1999
- 1999
- [j5]Haldun Aytug:
Simulation Analysis of Order and Kanban Sequencing Rules in a Kanban-Controlled Flow Shop. Simul. 72(4): 212-220 (1999) - 1998
- [j4]Haldun Aytug, Siddhartha Bhattacharyya, Gary J. Koehler:
Genetic learning through simulation: An investigation in shop floor scheduling. Ann. Oper. Res. 78: 1-29 (1998) - 1996
- [j3]Haldun Aytug, Gary J. Koehler:
Stopping Criteria for Finite Length Genetic Algorithms. INFORMS J. Comput. 8(2): 183-191 (1996) - [j2]Haldun Aytug, Can A. Dogan, Gökçe Bezmez:
Determining the Number of Kanbans: A Simulation Metamodeling Approach. Simul. 67(1): 23-32 (1996) - 1994
- [j1]Haldun Aytug, Gary J. Koehler, Jane L. Snowdon:
Genetic learning of dynamic scheduling within a simulation environment. Comput. Oper. Res. 21(8): 909-925 (1994)
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 12:52 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:
