UDC 519.854

I.V. Sergienko
V.M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine,
Kyiv, Ukraine,  incyb@incyb.kiev.ua

V.P. Shylo
V.M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine,
Kyiv, Ukraine,  v.shylo@gmail.com

V.O. Roshchyn
V.M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine,
Kyiv, Ukraine,  dopt135@gmail.com

D.O. Boyarchuk
V.M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine,
Kyiv, Ukraine,  dopt135@gmail.com

APPLYING ALGORITHM UNIONS TO SPECIFIC CLASSES
OF BOOLEAN PROGRAMMING PROBLEMS

REFERENCES

1. Sergienko I.V., Shylo V.P., Roshchin V.O. Discrete optimization. Algorithms and their effective use. Kyiv: Nauk. Dumka, 2020. 144 p.
2. Sergienko I.V., Shylo V.P., Roshchin V.O. Combining algorithms for solving discrete optimization problems. Kibernetyka ta systemnyi analiz. 2023. Vol. 59, No. 5. P. 55–65.
3. Shylo V.P., Glover F., Sergienko I.V. Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel. Kibernetyka ta systemnyi analiz. 2015. ╨в. 51, N 1. P. 20–29.
4. Misevi─Нius A. Letter: New best known solution for the most difficult QAP instance тАЬtai100aтАЭ. Memetic Computing. 2019. Vol. 11, N 3. P. 331–332. https://doi.org/10.1007/s12293-019-00289-y.
5. Yangming Z., Hao J.K., Duval B. Frequent pattern based search: A case study on the quadratic assignment problem. IEEE Transactions on Systems, Man, and Cybernetics: Systems. 2020. Vol. 52. P. 1503–1515. http://dx.doi.org/10.1109/TSMC.2020.3027860.
6. Misevi─Нius A., Veren╨С D. A hybrid genetic-hierarchical algorithm for the quadratic assignment problem. Entropy. 2021. Vol. 23, N 1. Article number 108. https://doi.org/10.3390/e23010108.
7. Wang H., Alidaee B. A new hybrid-heuristic for large-scale combinatorial optimization: A case of quadratic assignment problem. Computers & Industrial Engineering. 2023. Vol. 179. https://doi.org/10.1016/j.cie.2023.109220.
8. Chupov S.V., Fedorishko A.V. A hybrid algorithm for solving the quadratic assignment problem. Science Herald of Uzhgorod. University. Series "Mathematics and Informatics". 2025. Vol. 47, No. 2. P. 303–311. https://doi.org/10.24144/2616-7700.2025.47(2).303-311.
9. Sergienko I.V., Shylo V.P., Chupov S.V., Shylo P.V. On solving the quadratic assignment problem. Kibernetika i systemnyj analiz. 2020. Vol. 56, No. 1. P. 64–69.
10. Shylo P.V. An iterated tabu algorithm for solving a quadratic assignment problem. Kibernetika i systemnyj analiz, 2017, Vol. 53, No. 2, pp. 163–167.
11. Taillard E. Robust taboo search for the quadratic assignment problem. Parallel Computing. 1991. Vol. 17, Iss. 4–5. P. 443–455. https://doi.org/10.1016/S0167-8191(05)80147-4.
12. Sergienko I.V., Shylo V.P., Roshchin V.O., Shylo P.V., Boyarchuk D.O., Moroz V.K. Portfolios of algorithms for solving the quadratic assignment problem. Cybernetics and computer technologies. Kyiv: V.M. Glushkov Institute of Cybernetics, NAS of Ukraine, 2024. No. 3. P. 25–33. https://doi.org/10.34229/2707-451X.24.3.3.
13. Glover F., Laguna M., Marti R. Fundamentals of scatter search and path relinking. Control and Cybernetics. 2000. Vol. 39. P. 653–684.
14. Helmberg C., Rendl F. A spectral bundle method for semidefinite programming. SIAM J. on Optimization. 2000. Vol. 10. P. 673–696.
15. Ceria S., Nobili P., Sassano A. Set covering problem. In: Annotated Bibliographies in Combinatorial Optimization. Dellamico M., Maffioli F., Martello S. (Eds.). New York: J. Wiley and Sons, 1998. P. 415–428.
16. Shylo V.P. Solution of the minimum power coverage problem. Computer Mathematics. Kyiv: V.M. Glushkov Institute of Cybernetics of the National Academy of Sciences of Ukraine, 2013. N 2. P. 152–160.
17. Grossman T., Wool A. Computational experience with approximation algorithms for the set covering problem. Eur. J. Oper. Res. 1997. Vol. 101, N 1. P. 81–92.
18. Bautista J. A GRASP algorithm to solve the unicost set covering problem. Computers & Oper. Res. 2007. Vol. 34, N 10. P. 3162–3173.
19. Kinney G.W., Barnes J.W., Colletti B.W. A reactive tabu search algorithm with variable clustering for the unicost set covering problem. Int. J. Oper. Res. 2007. Vol. 2, N 2. P. 156–172.
20. Marchiori E., Steenbeek A.G. An iterated heuristic algorithm for the set covering problem. Proceeding of: Algorithm Engineering, 2nd International Workshop (WAEтАЩ98) (Saarbrucken, Germany, August 20–22, 1998). 1998. P. 155–166.
21. Musliu N. Local search algorithm for unicost set covering problem. Advances in Applied Artificial Intelligence. IEA/AIE 2006. Ali M., Dapoigny R. (Eds.). Lecture Notes in Artificial Intelligence. Berlin; Heidelberg: Springer, 2006. Vol. 4031. P. 302–311. https://doi.org/10.1007/11779568_34.