Optimization Online


Handelman's hierarchy for the maximum stable set problem

Monique Laurent (m.laurent***at***cwi.nl)
Zhao Sun (z.sun***at***uvt.nl)

Abstract: The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated as the maximization of a quadratic square-free polynomial over the (Boolean) hypercube. We investigate a hierarchy of linear programming relaxations for this problem, based on a result of Handelman showing that a positive polynomial over a polytope can be represented as conic combination of products of the linear constraints defining the polytope. We relate the rank of Handelman's hierarchy with structural properties of graphs. In particular we show a relation to fractional clique covers which we use to upper bound the Handelman rank for perfect graphs and determine its exact value in the vertex-transitive case. Moreover we show two upper bounds on the Handelman rank in terms of the (fractional) stability number of the graph and compute the Handelman rank for several classes of graphs including odd cycles and wheels and their complements. We also point out links to several other linear and semidefinite programming hierarchies.

Keywords: Polynomial optimization; Combinatorial optimization; Handelman hierarchy; Linear programming relaxation; The maximum stable set problem.

Category 1: Combinatorial Optimization

Category 2: Linear, Cone and Semidefinite Programming

Citation: Technical report, CWI, Amsterdam and Tilburg University, May 2013.

Download: [PDF]

Entry Submitted: 05/30/2013
Entry Accepted: 05/30/2013
Entry Last Modified: 10/09/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society