A Tabu Search algorithm for the minimum weight vertex cover problem
| dc.contributor.author | Essaid, Mokhtar | |
| dc.contributor.author | Rapporteur: Boumama, Salim | |
| dc.date.accessioned | 2023-05-28T13:13:18Z | |
| dc.date.available | 2023-05-28T13:13:18Z | |
| dc.date.issued | 2016-06-10 | |
| dc.description.abstract | In the study we deal with minimum weight vertex cover problem as one of the fundamental problems in graph theory with many important real-life applications such as, for example, in wireless communication, circuit design and network flows. It is a well-known NPcomplete problem and hence no polynomial-time algorithm has been found yet for solving it to optimality. We have implemented a modified Tabu search algorithm for tackling this problem in order to obtain good feasible solutions in the available time. The latter is enhanced by introducing greedy heuristics to improve the quality of initial seed solutions. The performance of our approach has been tested on well known dataset. | en_US |
| dc.identifier.uri | https://repository.univ-msila.dz/handle/123456789/38869 | |
| dc.language.iso | en | en_US |
| dc.publisher | University of M'sila | en_US |
| dc.subject | NP-complete problem, Tabu search, minimum weight vertex cover problem, greedy heuristics. | en_US |
| dc.title | A Tabu Search algorithm for the minimum weight vertex cover problem | en_US |
| dc.type | Thesis | en_US |