| Publication | Date of Publication | Type |
|---|
| Risk minimization and minimum description for linear discriminant functions | 2012-07-28 | Paper |
| Minimal equivalent binary knapsack inequalities | 2012-07-28 | Paper |
| Conditions that obviate the no-free-lunch theorems for optimization | 2012-06-18 | Paper |
| A heuristic for winner determination in rule-based combinatorial auctions | 2012-06-18 | Paper |
| A hybrid method for quantum global optimization | 2012-06-13 | Paper |
| An evolutionary approach to group decision making | 2012-05-30 | Paper |
| Detecting Management Fraud in Public Companies | 2012-02-27 | Paper |
| A Market-Based Optimization Algorithm for Distributed Systems | 2012-02-21 | Paper |
| Using modifications to Grover's search algorithm for quantum global optimization | 2010-09-09 | Paper |
| Induction over strategic agents: a genetic algorithm solution | 2010-05-10 | Paper |
| Induction over constrained strategic agents | 2009-12-21 | Paper |
| A location-allocation problem for a web services provider in a competitive market | 2008-11-20 | Paper |
| On a feasible-infeasible two-population (FI-2Pop) genetic algorithm for constrained optimization: Distance tracing and no free lunch | 2008-05-08 | Paper |
| The effect of multiple optima on the simple GA run-time complexity | 2006-12-14 | Paper |
| A general steady state distribution based stopping criteria for finite length genetic algorithms | 2006-11-15 | Paper |
| Learning genetic algorithm parameters using hidden Markov models | 2006-10-27 | Paper |
| Pricing combinatorial auctions. | 2004-02-02 | Paper |
| New stopping criterion for genetic algorithms | 2001-03-28 | Paper |
| A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets | 1999-02-22 | Paper |
| PAC-learning a decision tree with pruning | 1999-02-22 | Paper |
| Genetic learning through simulation: An investigation in shop floor scheduling | 1998-04-26 | Paper |
| New directions in genetic algorithm theory | 1998-02-25 | Paper |
| Stopping Criteria for Finite Length Genetic Algorithms | 1997-01-22 | Paper |
| A proof of the Vose-Liepins conjecture | 1996-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4834456 | 1995-07-05 | Paper |
| Genetic learning of dynamic scheduling within a simulation environment | 1995-02-13 | Paper |
| An investigation on the conditions of pruning an induced decision tree | 1994-09-15 | Paper |
| Linear Discriminant Functions Determined by Genetic Search | 1993-02-11 | Paper |
| Improper linear discriminant classifiers | 1991-01-01 | Paper |
| Relationships Between Various Markovian Decision Problem Classes | 1990-01-01 | Paper |
| On Optimal Allocation in a Distributed Processing Environment | 1982-01-01 | Paper |
| Bounds and elimination in generalized markov decisions | 1981-01-01 | Paper |
| Note—Sensitivity Analysis in Leontief Substitution Systems | 1980-01-01 | Paper |
| Technical Note—A Look at Finding Points of a Convex Polyhedron Using Relaxation and Subgradient Procedures | 1980-01-01 | Paper |
| A generalized Markov decision process | 1980-01-01 | Paper |
| The mixed postman problem | 1979-01-01 | Paper |
| A complementarity approach for solving Leontief substitution systems and (generalized) Markov decision processes | 1979-01-01 | Paper |
| Computation techniques for large scale undiscounted markov decision processes | 1979-01-01 | Paper |
| Value Convergence in a Generalized Markov Decision Process | 1979-01-01 | Paper |
| Note—A Comment on Rao's Class ℳ and S̄ Matrices | 1977-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4077718 | 1975-01-01 | Paper |
| The Solution of Leontief Substitution Systems using Matrix Iterative Techniques | 1975-01-01 | Paper |
| An iterative procedure for nondiscounted discrete-time markov decisions | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4404680 | 1974-01-01 | Paper |
