An algorithm for finding a maximum weighted independent set in an arbitrary graph

We propose and implement an exact algorithm for the maximum weighted independent set problem based on an unconstrained quadratic 0–1 formulation and branch and bound techniques. The use of a non-greedy branch and bound method using depth first search is presented and justified along with various heuristics to improve performance. We also present computational results using randomly generated graphs with up to 500 vertices.

[1]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[2]  P. Pardalos,et al.  A global optimization approach for solving the maximum clique problem , 1990 .

[3]  Panos M. Pardalos,et al.  A branch and bound algorithm for the maximum clique problem , 1992, Comput. Oper. Res..

[4]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[5]  P. Pardalos,et al.  An exact algorithm for the maximum clique problem , 1990 .

[6]  Michel Gendreau,et al.  An Efficient Implicit Enumeration Algorithm for the Maximum Clique Problem , 1988 .

[7]  Egon Balas,et al.  Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

[8]  E. Loukakis,et al.  Determining the number of internal stability of a graph , 1982 .

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[11]  P. Pardalos,et al.  Parallel branch and bound algorithms for quadratic zero–one programs on the hypercube architecture , 1990 .

[12]  Fanica Gavril,et al.  Algorithms for a maximum clique and a maximum independent set of a circle graph , 1973, Networks.

[13]  George L. Nemhauser,et al.  A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles , 1981, Math. Program..

[14]  Shuji Tsukiyama,et al.  A New Algorithm for Generating All the Maximal Independent Sets , 1977, SIAM J. Comput..

[15]  Egon Balas,et al.  On the Maximum Weight Clique Problem , 1987, Math. Oper. Res..

[16]  Alain Hertz,et al.  Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph , 1990, Comput. Oper. Res..