Author:
Kacprzyk Janusz,Szkatuła Grażyna
Reference42 articles.
1. Baker J.E. (1987) Reducing bias and inefficiency in the selection algorithm. In Genetic Algorithms and Their Applications: Proceedings of the 2nd International Conference on Genetic Algorithms. ed. J. J. Grefenstette, pp. 1421, LEA, Cambridge, MA.
2. Balas E. (1980) Cutting planes from conditional bounds: a new approach to set covering. Mathematical Programming Study 12, 19–36.
3. Balas E. and Ho A. (1980) Set covering algorithms using cutting planes, heuristics and subgradient optimisation: A computation study. Mathematical Programming Study 12, 37–60.
4. Balas E. and Padberg M.W. (1979) Set partitioning - A survey. In: N. Christofides (ed.) Combinatorial Optimisation, Wiley, New York.
5. Beasley J.E. (1987) An algorithm for set covering problem. European Journal of Operational Research 31, 85–93.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Reduction of Data Series Dimensionality;Studies in Computational Intelligence;2014