A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems

DOI10.1057/palgrave.jors.2600405zbMath0882.90112OpenAlexW2011145472MaRDI QIDQ4347406

Mhand Hifi

Publication date: 7 August 1997

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600405

zbMATH Keywords

genetic algorithm-based heuristicunweighted maximum clique problemweighted maximum independent set problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Combinatorial optimization (90C27)

Related Items (3)

On the unified dispersion problem: efficient formulations and exact algorithms ⋮ Network Inspection for Detecting Strategic Attacks ⋮ Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling

This page was built for publication: A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems