A novel evolutionary formulation of the maximum independent set problem
From MaRDI portal
Publication:1777419
DOI10.1007/s10878-004-4835-9zbMath1079.90145arXivcs/0309038OpenAlexW3099305697WikidataQ115468157 ScholiaQ115468157MaRDI QIDQ1777419
Luciana C. D. Campos, Valmir C. Barbosa
Publication date: 13 May 2005
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0309038
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
An adaptive multistart tabu search approach to solve the maximum clique problem ⋮ Local search with edge weighting and configuration checking heuristics for minimum vertex cover ⋮ Optimization of supply diversity for the self-assembly of simple objects in two and three dimensions ⋮ An efficient local search framework for the minimum weighted vertex cover problem ⋮ Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers
Uses Software
This page was built for publication: A novel evolutionary formulation of the maximum independent set problem