A Hybrid Algorithm for Solving the Problem of Finding the Maximum Independent Graph Vertex Set

Mathematical Methods of Operations Research · Springer Nature · 2026-09-01 · DOI: 10.1007/s10559-026-00920-0

Аннотация

A hybrid stochastic algorithm for solving the problem of finding the maximum independent graph vertex set is proposed that combines certain metaheuristic search mechanisms. The computational experiments that were conducted using the widely known DIMACS test problems shoved the competitiveness of the proposed algorithm. Its comparison with better well-known algorithms proves the efficiency of the developed algorithm both in relation to the solution time and the quality of obtained results.

Читать у издателя →

Похожие статьи