In this paper we propose the approach to solving several combinatorial optimization problems using local search and genetic algorithm techniques. Initially this approach was developed in purpose to overcome some difficulties inhibiting the application of above-mentioned techniques to the problems of the Questionnaire Theory. But when the algorithms were developed it became clear that them could be successfully applied also to the Minimal Set Cover, the 0-1-Knapsack and probably to other combinatorial optimization problems.
Citation
Arxiv.org: http://arxiv.org/abs/1004.5262