Author:
Kacprzyk Janusz,Szkatuła Grażyna
Publisher
Springer Berlin Heidelberg
Reference39 articles.
1. Balas, E.: Cutting planes from conditional bounds: a new approach to set covering. Mathematical Programming Study 12, 19–36 (1980)
2. Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics and sub gradient optimisation: A computation study. Mathematical Programming 12, 37–60 (1980)
3. Balas, E., Padberg, M.W.: Set partitioning - A survey. In: Christofides, N. (ed.) Combinatorial Optimisation. Wiley, New York (1979)
4. Beasley, J.E.: An algorithm for set covering problem. European Journal of Operational Research 31, 85–93 (1987)
5. Beasley, J.E.: A Lagrangian heuristic for set covering problem. Naval Research Logistics Quarterly 37, 151–164 (1990)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Matching Between Intuitionistic Fuzzy Sets;Studies in Computational Intelligence;2024
2. Matching Between Multisets;Studies in Computational Intelligence;2024
3. On Reduction of Data Series Dimensionality;Studies in Computational Intelligence;2014