کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4652452 1632596 2009 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Strength of facets for the set covering and set packing polyhedra on circulant matrices
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Strength of facets for the set covering and set packing polyhedra on circulant matrices
چکیده انگلیسی

In this paper we prove that the N+-rank coincides with the disjunctive and N-rank for the linear relaxation of the set covering polyhedron of the circulant matrices and if s⩾k+1. We analyze the behavior of the same operators on the clique relaxation of the stable set polytope of with n⩾6, which has been completely described by Dahl [Dahl, G., Stable Set Polytopes for a Class of Circulant Graphs, SIAM Journal]. We define the strength of the facets with respect to the linear relaxation of the set packing and set covering polyhedra, according to these operators and compare the results with Goemans' measure [Argiroffo, G. and S. Bianchi, The nonidealness index of rank-ideal matrices, Preprint (2008)].

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 35, 1 December 2009, Pages 109-114