Extended Formulations for Independence Polytopes of Regular Matroids

We show that the independence polytope of every regular matroid has an extended formulation of size quadratic in the size of its ground set. This generalizes a similar statement for (co-)graphic matroids, which is a simple consequence of Martin’s extended formulation for the spanning-tree polytope. In our construction, we make use of Seymour’s decomposition theorem for regular matroids. As a consequence, the extended formulations can be computed in polynomial time.

[1]  Michele Conforti,et al.  Subgraph polytopes and independence polytopes of count matroids , 2015, Oper. Res. Lett..

[2]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[3]  Samuel Fiorini,et al.  Combinatorial bounds on nonnegative rank and extended formulations , 2011, Discret. Math..

[4]  W. T. Tutte.  An algorithm for determining whether a given binary matroid is graphic. , 1960 .

[5]  Thomas Rothvoß,et al.  Some 0/1 polytopes need exponential size extended formulations , 2011, Math. Program..

[6]  Jack Edmonds,et al.  Submodular Functions, Matroids, and Certain Polyhedra , 2001, Combinatorial Optimization.

[7]  Hans Raj Tiwary,et al.  Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.

[8]  Paul D. Seymour,et al.  Decomposition of regular matroids , 1980, J. Comb. Theory, Ser. B.

[9]  Francesco Grande,et al.  Theta rank, levelness, and matroid minors , 2014, J. Comb. Theory, Ser. B.

[10]  Justin C. Williams,et al.  A linear‐size zero—one programming model for the minimum spanning tree problem in planar graphs , 2002, Networks.

[11]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[12]  Yoshio Okamoto,et al.  Extended formulations for sparsity matroids , 2014, Math. Program..

[13]  Thomas Rothvoß,et al.  The matching polytope has exponential extension complexity , 2013, STOC.

[14]  R. Kipp Martin,et al.  Using separation algorithms to generate mixed integer model reformulations , 1991, Oper. Res. Lett..

[15]  Volker Kaibel,et al.  A Short Proof that the Extension Complexity of the Correlation Polytope Grows Exponentially , 2013, Discret. Comput. Geom..