Haldun Aytug

According to our database1, Haldun Aytug authored at least 32 papers between 1994 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Bidding on Keyword Auctions: Advertiser's Perspective.
Proceedings of the 42nd International Conference on Information Systems, 2021

2016
Comparison of imputation methods for discriminant analysis with strategically hidden data.
Eur. J. Oper. Res., 2016

2015
Feature selection for support vector machines using Generalized Benders Decomposition.
Eur. J. Oper. Res., 2015

2014
Research Note - Discriminant Analysis with Strategically Manipulated Data.
Inf. Syst. Res., 2014

2012
Exploring the trade-off between generalization and empirical errors in a one-norm SVM.
Eur. J. Oper. Res., 2012

2010
Detecting Management Fraud in Public Companies.
Manag. Sci., 2010

Disclosure Control of Confidential Data by Applying Pac Learning Theory.
J. Database Manag., 2010

Data mining with agent gaming.
Inf. Technol. Manag., 2010

Induction over Strategic Agents.
Inf. Syst. Res., 2010

Induction over constrained strategic agents.
Eur. J. Oper. Res., 2010

Making words work: Using financial text as a predictor of financial events.
Decis. Support Syst., 2010

Induction over Strategic Agents: a genetic algorithm solution.
Ann. Oper. Res., 2010

2009
Using support vector machines to learn the efficient set in multiple objective discrete optimization.
Eur. J. Oper. Res., 2009

Using domain-specific knowledge in generalization error bounds for support vector machine learning.
Decis. Support Syst., 2009

Principal-agent learning.
Decis. Support Syst., 2009

2008
Erratum to "Minimizing makespan on a single machine subject to random breakdowns": [Oper. Res. Letters 34 (2006) 29-36].
Oper. Res. Lett., 2008

Systems for strategic learning.
Inf. Syst. E Bus. Manag., 2008

Risk Minimization and Minimum Description for Linear Discriminant Functions.
INFORMS J. Comput., 2008

2007
The effect of multiple optima on the simple GA run-time complexity.
Eur. J. Oper. Res., 2007

Provider selection and task allocation issues in networks with different QoS levels and all you can send pricing.
Decis. Support Syst., 2007

2006
Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach.
J. Sched., 2006

Minimizing makespan on a single machine subject to random breakdowns.
Oper. Res. Lett., 2006

Learning in the Presence of Self-Interested Agents.
Proceedings of the 39th Hawaii International International Conference on Systems Science (HICSS-39 2006), 2006

2005
Executing production schedules in the face of uncertainties: A review and some future directions.
Eur. J. Oper. Res., 2005

2004
Discovering subproblem prioritization rules for shifting bottleneck algorithms.
J. Intell. Manuf., 2004

2002
Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study.
Eur. J. Oper. Res., 2002

2000
New stopping criterion for genetic algorithms.
Eur. J. Oper. Res., 2000

1999
Simulation Analysis of Order and Kanban Sequencing Rules in a Kanban-Controlled Flow Shop.
Simul., 1999

1998
Genetic learning through simulation: An investigation in shop floor scheduling.
Ann. Oper. Res., 1998

1996
Determining the Number of Kanbans: A Simulation Metamodeling Approach.
Simul., 1996

Stopping Criteria for Finite Length Genetic Algorithms.
INFORMS J. Comput., 1996

1994
Genetic learning of dynamic scheduling within a simulation environment.
Comput. Oper. Res., 1994


  Loading...