On a Polynomial Fractional Formulation for Independence Number of a Graph

  • Authors:

  • Balabhaskar Balasundaram;Sergiy Butenko

  • Affiliations:

  • Department of Industrial and Systems Engineering, Texas A&M University, College Station, USA 77843;Department of Industrial and Systems Engineering, Texas A&M University, College Station, USA 77843

  • Venue:
  • Journal of Global Optimization
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we characterize the local maxima of a continuous global optimization formulation for finding the independence number of a graph. Classical Karush-Kuhn-Tucker conditions and simple combinatorial arguments are found sufficient to deduce several interesting properties of the local and global maxima. These properties can be utilized in developing new approaches to the maximum independent set problem.