GENOCOP

Abstract

Many interesting optimization problems have no known fast solution algorithms either because their objective functions are complicated (and possibly discontinuous) or because they contain difficult constraint structures. For such problems, in practice, any near-optimal solution would be desirable if obtained with a reasonable effort. For many problems with difficult objective functions this can be done using probabilistic search methods; however, such methods have no general way of handling constraints.