A Genetic Algorithm for Solving (UN) Weighted Independent Set, Vertex Covering, Set Packing and Clique Problems.

In this paper we present a meta-heuristic, known as a genetic algorithm, in order to solve the problems of (weigthed) independent set (IS), vertex covering (VC), set packing (SP) and maximum clique (MC).

MoreLess

Year of publication:	1996
Authors:	Hifi, M
Institutions:	Centre de recherche de mathématiques et économie mathématique (CERMSEM), Centre d'Économie de la Sorbonne
Subject:	MATHEMATICS \| ECONOMETRICS

More details

Series:	Papiers d'Economie Mathématique et Applications.
Type of publication:	Book / Working Paper
Notes:	20 pages
Classification:	C1 - Econometric and Statistical Methods: General
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10005478338