Let G = (V,E) be a simple undirected graph. A forest F ⊆ E of G is said to be clique-connecting if each tree of F spans a clique of G. This paper adresses the clique-connecting forest polytope. First we give a formulation and a polynomial time separation algorithm. Then we show that the nontrivial nondegenerate facets of the stable set polytope are facets of the clique-connecting polytope. Finally we introduce a family of rank inequalities which are facets, and which generalize the clique inequalities.
Mots-clés : graph, polytope, separation, facet
@article{RO_2010__44_1_73_0, author = {Cornaz, Denis}, title = {Clique-connecting forest and stable set polytopes}, journal = {RAIRO - Operations Research - Recherche Op\'erationnelle}, pages = {73--83}, publisher = {EDP-Sciences}, volume = {44}, number = {1}, year = {2010}, doi = {10.1051/ro/2010005}, mrnumber = {2642917}, zbl = {1221.05132}, language = {en}, url = {http://www.numdam.org/articles/10.1051/ro/2010005/} }
TY - JOUR AU - Cornaz, Denis TI - Clique-connecting forest and stable set polytopes JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2010 SP - 73 EP - 83 VL - 44 IS - 1 PB - EDP-Sciences UR - http://www.numdam.org/articles/10.1051/ro/2010005/ DO - 10.1051/ro/2010005 LA - en ID - RO_2010__44_1_73_0 ER -
Cornaz, Denis. Clique-connecting forest and stable set polytopes. RAIRO - Operations Research - Recherche Opérationnelle, Tome 44 (2010) no. 1, pp. 73-83. doi : 10.1051/ro/2010005. http://www.numdam.org/articles/10.1051/ro/2010005/
[1] Cliques, holes and the vertex coloring polytope. Inf. Process. Lett. 89 (2004) 159-164. | Zbl
, and ,[2] A one-to-one correspondence beetween stables sets and colorings. Oper. Res. Lett. 36 (2008) 673-676. | Zbl
and ,[3] Wheel inequalitites for stable set polytopes. Math. Program. 77 (1997) 389-421. | Zbl
and ,[4] Maximum matching and a polyhedron with 0,1-vertices. Journal of Resarch National Bureau of Standards Section B 69 (1965) 67-72. | Zbl
,[5] Matroids and the greedy algorithm. Math. Program. 1 (1971) 127-136. | Zbl
,[6] The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981) 169-197. | Zbl
, and ,[7] On the facial structure of set packing polyhedra. Math. Program. 5 (1973) 199-215. | Zbl
,[8] Fractional covers for forests and matchings. Math. Program. 29 (1984) 1-14. | Zbl
and ,[9] Selected applications of minimum cuts in networks. INFOR Can. J. Oper. Res. Inf. Process. 20 (1982) 394-422. | Zbl
and ,[10] A selection problem of shared fixed costs and network flows. Manag. Sci. 17 (1970) 200-207. | Zbl
,[11] Combinatorial Optimization. Springer-Verlag, Berlin, Heidelberg (2003). | Zbl
,Cité par Sources :