Formulations for the Stable Set Polytope
نویسندگان
چکیده
We give a simple algorithm for the weighted stable set problem of an arbitrary graph which yields an extended formulation for its stable set polytope The algorithm runs in polynomial time for the class of distance claw free graphs These are the graphs such that for each node neither its neighbour set nor the set of nodes at distance two contain a stable set of size three The extended formulation we obtain is of polynomial size for distance claw free graphs These graphs are of interest from the point of view of their stable set polyhedra due to the fact that all of the complicated necessary inequalities given by Giles and Trotter for the polyhedra of claw free graphs are also necessary for the class of distance claw free graphs
منابع مشابه
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
In this paper, we provide the first linear programming formulations for the stable set problem in claw-free graphs, together with polynomial time separation routines for those formulations (they are not compact). We then exploit one of those extended formulations and propose a new polytime algorithm for solving the separation problem for the stable set polytope of claw-free graphs. This routine...
متن کاملStrengthened 0-1 linear formulation for the daily satellite mission planning
In this paper, we compare several 0-1 linear programs for solving the satellite mission planning problem. We prove that one of them presents a smaller integrality gap. Our explanation is based on stable set polytope formulations for perfect graphs. keywords: Integer programming, stable set polytope, satellite mission planning, cocomparability graph.
متن کاملPolyhedral studies of vertex coloring problems: The asymmetric representatives formulation
Despite the fact that some vertex coloring problems are polynomially solvable on certain graph classes, most of these problems are not “under control” from a polyhedral point of view. The equivalence between optimization and polyhedral separation suggests that, for these problems, there must exist formulations admitting some elegant characterization for the polytopes associated to them. Therefo...
متن کاملPolyhedral studies in Domination Graph Theory (I)
This paper discusses polyhedral approaches to problems in Domination Graph Thoery. We give various linear integer programming formulations for the weighted and unweighted versions of the minimum dominating set problem. We study the associated polytopes and determine dimension of the polytopes, facets, valid inequalities et al. Ideas from integer programming such as lift and project are used to ...
متن کاملLifting Linear Extension Complexity Bounds to the Mixed-Integer Setting
Mixed-integer mathematical programs are among the most commonly used models for a wide set of problems in Operations Research and related fields. However, there is still very little known about what can be expressed by small mixed-integer programs. In particular, prior to this work, it was open whether some classical problems, like the minimum odd-cut problem, can be expressed by a compact mixe...
متن کامل