A hybrid iterated local search heuristic for the maximum weight independent set problem

DOI10.1007/s11590-017-1128-7zbMath1401.90250MaRDI QIDQ1749784

Anand Subramanian, Rian Gabriel S. Pinheiro, Bruno Nogueira

Publication date: 28 May 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-017-1128-7

zbMATH Keywords

metaheuristics; maximum weight independent set; minimum weight vertex cover; iterated local search; maximum weight clique

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C59: Approximation methods and heuristics in mathematical programming

90C27: Combinatorial optimization

Related Items

ils-mwis

Uses Software

• SubMAP