Solution of Covering Problem

Student: Denis Denisov

Faculty: Faculty of Informatics, Mathematics, and Computer Science (HSE Nizhny Novgorod)

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Year of Graduation: 2024

The set covering problem forms one of the fundamental principles of combinatorial optimization theory and has many practical applications. Solving this problem allows you to effectively optimize the processes of planning and allocating resources, which contributes to improving the productivity and effectiveness of the system. The purpose of this work is to explore the possibilities of various algorithms for solving the problem of coverage and various options for their hybridization.

Student Theses at HSE must be completed in accordance with the University Rules and regulations specified by each educational programme.

Summaries of all theses must be published and made freely available on the HSE website.

The full text of a thesis can be published in open access on the HSE website only if the authoring student (copyright holder) agrees, or, if the thesis was written by a team of students, if all the co-authors (copyright holders) agree. After a thesis is published on the HSE website, it obtains the status of an online publication.

Student theses are objects of copyright and their use is subject to limitations in accordance with the Russian Federation’s law on intellectual property.

In the event that a thesis is quoted or otherwise used, reference to the author’s name and the source of quotation is required.

Search all student theses