Geodesic
Proof of covering minimality by generalizing the notion of independence
Diskretnyj analiz i issledovanie operacij, Tome 24 (2017) no. 2, pp. 87-106.

Voir la notice de l'article provenant de la source Math-Net.Ru

A method is proposed for obtaining lower bounds for the length of the shortest cover and complexity of the minimal cover based on the notion of independent family of sets. For the problem of minimization of Boolean functions, we provide the functions and construct coverings by faces of the set of unit vertices for which the suggested lower bounds can be achieved in the case of five or more variables. The lower bounds, based on independent sets, are unreachable and cannot be used as sufficient conditions for minimality of such functions. Bibliogr. 11.
Keywords: set covering problem, complexity, shortest cover, minimum cover, independent set, lower bound, condition of minimality. 
@article{DA_2017_24_2_a5,
     author = {I. P. Chukhrov},
     title = {Proof of covering minimality by generalizing the notion of independence},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {87--106},
     publisher = {mathdoc},
     volume = {24},
     number = {2},
     year = {2017},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2017_24_2_a5/}
}
TY  - JOUR
AU  - I. P. Chukhrov
TI  - Proof of covering minimality by generalizing the notion of independence
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2017
SP  - 87
EP  - 106
VL  - 24
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2017_24_2_a5/
LA  - ru
ID  - DA_2017_24_2_a5
ER  - 
%0 Journal Article
%A I. P. Chukhrov
%T Proof of covering minimality by generalizing the notion of independence
%J Diskretnyj analiz i issledovanie operacij
%D 2017
%P 87-106
%V 24
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2017_24_2_a5/
%G ru
%F DA_2017_24_2_a5
I. P. Chukhrov. Proof of covering minimality by generalizing the notion of independence. Diskretnyj analiz i issledovanie operacij, Tome 24 (2017) no. 2, pp. 87-106. http://geodesic.mathdoc.fr/item/DA_2017_24_2_a5/

[1] A. V. Eremeev, L. A. Zaozerskaya, A. A. Kolokolov, “The set covering problem: Complexity, algorithms, and experimental investigations”, Diskretn. Anal. Issled. Oper., Ser. 2, 7:2 (2000), 22–46 (Russian) | MR | Zbl

[2] G. I. Zabinyako, “Implementation of algorithms for solution to the set covering problem and analysis of their efficiency”, Comput. Technol., 12:6 (2007), 50–58 | Zbl

[3] V. K. Leont'ev, “Discrete optimization”, Comput. Math. Math. Phys., 47:2 (2007), 328–340 | DOI | MR | Zbl

[4] I. P. Chukhrov, “On complexity measures of complexes of faces in the unit cube”, J. Appl. Ind. Math., 8:1 (2014), 9–19 | DOI | MR | Zbl

[5] I. P. Chukhrov, “On a minimization problem for a set of boolean functions”, J. Appl. Ind. Math., 9:3 (2015), 335–350 | DOI | DOI | MR | Zbl

[6] Al-Shihabi S., Arafeh M., Barghash M., “An improved hybrid algorithm for the set covering problem”, Comput. Ind. Eng., 85 (2015), 328–334 | DOI

[7] Coudert O., “On solving covering problems”, Proc. 33rd Design Automation Conf. (Las Vegas, NV, June 3–7, 1996), ACM, New York, 1996, 197–202

[8] Coudert O., Sasao T., “Two-level logic minimization”, Logic synthesis and verification, Springer Int. Ser. Eng. Comp. Sci., 654, Kluwer Acad. Publ., Norwell, MA, 2002, 1–27

[9] Gao C., Yao X., Weise T., Li J., “An efficient local search heuristic with row weighting for the unicost set covering problem”, Eur. J. Oper. Res., 246:3 (2015), 750–761 | DOI | MR | Zbl

[10] Sapkota N., Reilly C. H., “Simulating realistic set covering problems with known optimal solutions”, Comput. Ind. Eng., 61:1 (2011), 39–47 | DOI

[11] Vasko F. J., Lu Y., Zyma K., “What is the best greedy-like heuristic for the weighted set covering problem?”, Oper. Res. Lett., 44:3 (2016), 366–369 | DOI | MR