An unconstrained binary quadratic programming for the maximum independent set problem
Keyword(s):
For a given graph G = (V, E) the maximum independent set problem is to find the largest subset of pairwise nonadjacent vertices. We propose a new model which is a reformulation of the maximum independent set problem as an unconstrained quadratic binary programming, and we resolve it afterward by means of a genetic algorithm. The efficiency of the approach is confirmed by results of numerical experiments on DIMACS benchmarks.
2009 ◽
Vol 34
◽
pp. 127-131
◽
1997 ◽
Vol 97
(3)
◽
pp. 580-592
◽
2016 ◽
Vol 25
(2)
◽
pp. 203-208
◽
2014 ◽
Vol 687-691
◽
pp. 1161-1165