Vertex adjacencies in the set covering polyhedron

We describe the adjacency of vertices of the (unbounded version of the) set covering polyhedron, in a similar way to the description given by Chvtal for the stable set polytope. We find a sufficient condition for adjacency, and characterize it with similar conditions in the case where the underlying matrix is row circular. We apply our findings to show a new infinite family of minimally nonideal matrices.

[1]  Alfred Lehman,et al.  On the width-length inequality , 1979, Math. Program..

[2]  Antonio Sassano,et al.  The Hirsch Conjecture for the fractional stable set polytope , 2014, Math. Program..

[3]  James B. Orlin,et al.  Cyclic Scheduling via Integer Programs with Circular Ones , 1980, Oper. Res..

[4]  François Margot,et al.  A catalog of minimally nonideal matrices , 1998, Math. Methods Oper. Res..

[5]  V. Chvátal.  On certain polytopes associated with graphs , 1975 .

[6]  Tomomi Matsui,et al.  NP-Completeness of Non-Adjacency Relations on Some 0-1 Polytopes , 1998 .

[7]  Bernhard Korte,et al.  Colouring criteria for adjacency on 0–1-polyhedra , 1978 .

[8]  Katta G. Murty,et al.  Adjacency on the Constrained Assignment Problem , 1998, Discret. Appl. Math..

[9]  Friedrich Eisenbrand,et al.  The stable set polytope of quasi-line graphs , 2010, Comb..

[10]  Carla Michini,et al.  The stable set problem: some structural properties and relaxations , 2012, 4OR.

[11]  Michel Deza,et al.  Combinatorics and Computer Science , 1996, Lecture Notes in Computer Science.

[12]  Komei Fukuda,et al.  Double Description Method Revisited , 1995, Combinatorics and Computer Science.

[13]  Christos H. Papadimitriou,et al.  The adjacency relation on the traveling salesman polytope is NP-Complete , 1978, Math. Program..

[14]  Alfred Lehman,et al.  The Width-Length Inequality and Degenerate Projective Planes , 1990, Polyhedral Combinatorics.

[15]  Gérard Cornuéjols,et al.  Ideal 0, 1 Matrices , 1994, J. Comb. Theory, Ser. B.

[16]  Jonathan Wang,et al.  A new infinite family of minimally nonideal matrices , 2011, J. Comb. Theory A.

[17]  D. West.  Introduction to Graph Theory , 1995 .

[18]  Akihisa Tamura,et al.  Ideal polytopes and face structures of some combinatorial optimization problems , 1995, Math. Program..

[19]  Tomomi Matsui,et al.  Adjacency on Combinatorial Polyhedra , 1995, Discret. Appl. Math..