Circuit and bond polytopes on series-parallel graphs

In this paper, we describe the circuit polytope on series-parallel graphs. We first show the existence of a compact extended formulation. Though not being explicit, its construction process helps us to inductively provide the description in the original space. As a consequence, using the link between bonds and circuits in planar graphs, we also describe the bond polytope on series-parallel graphs.

[1]  A. R. Mahjoub,et al.  On the stable set polytope of a series-parallel graph , 1988, Math. Program..

[2]  Viet Hung Nguyen,et al.  On the linear description of the 3-cycle polytope , 2002, Eur. J. Oper. Res..

[3]  William R. Pulleyblank,et al.  On cycle cones and polyhedra , 1989 .

[4]  Ali Ridha Mahjoub,et al.  The Steiner Traveling Salesman Polytope and Related Polyhedra , 2002, SIAM J. Optim..

[5]  R. Duffin.  Topology of series-parallel networks , 1965 .

[6]  Mohamed Didi Biha,et al.  K-edge Connected Polyhedra on Series-parallel Graphs , 1996, Oper. Res. Lett..

[7]  Gérard Cornuéjols,et al.  Extended formulations in combinatorial optimization , 2013, Ann. Oper. Res..

[8]  Petra Bauer.  The Circuit Polytope: Facets , 1997, Math. Oper. Res..

[9]  Egon Balas,et al.  programming: Properties of the convex hull of feasible points * , 1998 .

[10]  Gérard Cornuéjols,et al.  The traveling salesman problem on a graph and some related integer polyhedra , 1985, Math. Program..

[11]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[12]  Amit Chakrabarti,et al.  When the cut condition is enough: a complete characterization for multiflow problems in series-parallel networks , 2012, STOC '12.

[13]  T. Pentikäinen,et al.  On model building for insurance industry , 1983 .

[14]  Sunil Chopra,et al.  The Graph Partitioning Polytope on Series-Parallel and4-Wheel Free Graphs , 1994, SIAM J. Discret. Math..

[15]  David Eppstein,et al.  Parallel Recognition of Series-Parallel Graphs , 1992, Inf. Comput..

[16]  Egon Balas,et al.  On the Dimension of Projected Polyhedra , 1998, Discret. Appl. Math..

[17]  Jean Baptiste Joseph Fourier,et al.  Oeuvres de Fourier: Solution d'une question particulière du calcul des inégalités , 2013 .

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

[19]  Mourad Baïou,et al.  Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel Graphs , 1997, SIAM J. Discret. Math..

[20]  Ronald L. Rardin,et al.  Polyhedral Characterization of Discrete Dynamic Programming , 1990, Oper. Res..

[21]  Volker Kaibel,et al.  On cardinality constrained cycle and path polytopes , 2007, Math. Program..

[22]  Martin W. P. Savelsbergh,et al.  A branch and cut approach to the cardinality constrained circuit problem , 2002, Math. Program..

[23]  E. Balas.  Disjunctive programming and a hierarchy of relaxations for discrete optimization problems , 1985 .

[24]  Viet Hung Nguyen,et al.  On the Linear Description of the k‐cycle Polytope , 2001 .