Variable Neighborhood Search for Solving Combinatorial Optimization Problems

Student: Matyushin Maksim

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

Educational Programme: Applied Mathematics and Information Science (Bachelor)

Final Grade: 7

Year of Graduation: 2017

Critical nodes detection problem is well-known NP complete problem of graph theory, which has a large number of applications in different spheres. The purpose of this work is to develop the algorithm, which includes minimization of certain target function and applying the metaheuristic Variable Neighborhood Search for searching an optimal solution inside of many neighborhood. The program was developed and realized that implements this algorithm. This program was tested on graphs of various size and the results of computational experiments were compared with results of other algorithms.

Full text (added May 29, 2017)

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