IDEAS home Printed from https://ideas.repec.org/p/cor/louvco/1992009.html
   My bibliography  Save this paper

More facets from fences for linear ordering and acyclic subgraph polytopes

Author

Listed:
  • LEUNG, Janny
  • LEE, Jon

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

Abstract

We present new facets for the linear ordering polytope. These new facets generalize facets induced by sub graphs called fences, introduced by Grotschel, Junger and Reinelt (1985), and augmented fences, introduced by McLennan (1990). One novelty of the facets introduced here is that each sub graph induces not one but a family of facets, which are not generally rank inequalities. Indeed, we provide the smallest known example of a facet-representing inequality for the linear ordering polytope that is not a rank inequality. Gilboa (1990) introduced the diagonal inequalities for the linear ordering polytope, and Fishburn (1991) posed the question of identifying precisely which diagonal inequalities represent facets. We completely resolve Fishburn's question. Some of our results can be transported to the acyclic subgraph polytope. These new facets for the acyclic subgraph polytope are the first ones that are not represented by rank inequalities.

Suggested Citation

  • LEUNG, Janny & LEE, Jon, 1992. "More facets from fences for linear ordering and acyclic subgraph polytopes," LIDAM Discussion Papers CORE 1992009, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    • Handle: RePEc:cor:louvco:1992009
    as

    Download full text from publisher

    File URL: https://sites.uclouvain.be/core/publications/coredp/coredp1992.html
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    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:1992009. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Alain GILLIS (email available below). General contact details of provider: https://edirc.repec.org/data/coreebe.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.