Author:
Belykh Aleksander,Gruzdeva Tatyana,Ushakov Anton,Vasilyev Igor
Publisher
Springer International Publishing
Reference34 articles.
1. Avella, P., Boccia, M., Vasilyev, I.: Computational experience with general cutting planes for the set covering problem. Oper. Res. Lett. 37(1), 16–29 (2009)
2. Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. In: Padberg, M.W. (ed.) Combinatorial Optimization, Mathematical Programming Studies, vol. 12, pp. 37–60, Springer, Berlin (1980)
3. Balas, E., Padberg, M.W.: Set partitioning: a survey. SIAM Rev. 18(4), 710–760 (1976)
4. Beasley, J.E.: An algorithm for set covering problem. Eur. J. Oper. Res. 31(1), 85–93 (1987)
5. Beasley, J.E., Chu, P.C.: A genetic algorithm for the set covering problem. Eur. J. Oper. Res. 94(2), 392–404 (1996)