IDEAS home Printed from
   My bibliography  Save this paper

An extension of disjunctive programming and its impact for compact tree formulations


  • STEPHAN, Rüdiger

    () (Université catholique de Louvain,CORE, B-1348 Louvain-la-Neuve, Belgium)


In the 1970’s, Balas [2, 4] introduced the concept of disjunctive programming, which is optimization over unions of polyhedra. One main result of his theory is that, given linear descriptions for each of the polyhedra to be taken in the union, one can easily derive an extended formulation of the convex hull of the union of these polyhedra. In this paper, we give a generalization of this result by extending the polyhedral structure of the variables coupling the polyhedra taken in the union. Using this generalized concept, we derive polynomial size linear programming formulations (compact formulations) of a well- known spanning tree approximation of Steiner trees and flow equivalent trees for node- as well as edge- capacitated undirected networks. We also present a compact formulation for Gomory-Hu trees, and, as a consequence, of the minimum T-cut problem (but not for the associated T-cut polyhedron). Recently, Kaibel and Loos [10] introduced a more involved framework called polyhedral branching systems to derive extended formulations. The most of our model can be expressed in terms of their framework. The value of our model can be seen in the fact that it completes their framework with an interesting algorithmic aspect.

Suggested Citation

  • STEPHAN, Rüdiger, 2010. "An extension of disjunctive programming and its impact for compact tree formulations," CORE Discussion Papers 2010045, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
  • Handle: RePEc:cor:louvco:2010045

    Download full text from publisher

    File URL:
    Download Restriction: no

    References listed on IDEAS

    1. Rabah Amir, 2005. "Supermodularity and Complementarity in Economics: An Elementary Survey," Southern Economic Journal, Southern Economic Association, vol. 71(3), pages 636-660, January.
    2. Winfried Pohlmeier & Luc Bauwens & David Veredas, 2007. "High frequency financial econometrics. Recent developments," ULB Institutional Repository 2013/136223, ULB -- Universite Libre de Bruxelles.
    Full references (including those not matched with items on IDEAS)

    More about this item


    disjunctive programming; compact formulation; flow-equivalent trees; Gomory-Hu trees;

    NEP fields

    This paper has been announced in the following NEP Reports:


    Access and download statistics


    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:cor:louvco:2010045. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Alain GILLIS). General contact details of provider: .

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.