IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v21y1973i1p261-269.html
   My bibliography  Save this article

A Graph-Theoretic Equivalence for Integer Programs

Author

Listed:
  • Jean-Claude Picard

    (École Polytechnique, Montreal, Quebec, Canada)

  • H. Donald Ratliff

    (University of Florida, Gainesville, Florida)

Abstract

This paper is concerned with the relation between 0-1 integer programs and graphs. An equivalence is established between solving 0-1 integer programs with quadratic or linear objective functions and solving a cut problem on a related graph.

Suggested Citation

  • Jean-Claude Picard & H. Donald Ratliff, 1973. "A Graph-Theoretic Equivalence for Integer Programs," Operations Research, INFORMS, vol. 21(1), pages 261-269, February.
    • Handle: RePEc:inm:oropre:v:21:y:1973:i:1:p:261-269
    DOI: 10.1287/opre.21.1.261
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.21.1.261
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.21.1.261?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. AVELLA, Pasquale & BOCCIA, Maurizio & WOLSEY, Laurence A., 2014. "Single-period cutting planes for inventory routing problems," LIDAM Discussion Papers CORE 2014055, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Skålnes, Jørgen & Andersson, Henrik & Desaulniers, Guy & Stålhane, Magnus, 2022. "An improved formulation for the inventory routing problem with time-varying demands," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1189-1201.
    3. Bertazzi, Luca & Laganà, Demetrio & Ohlmann, Jeffrey W. & Paradiso, Rosario, 2020. "An exact approach for cyclic inbound inventory routing in a level production system," European Journal of Operational Research, Elsevier, vol. 283(3), pages 915-928.
    4. Pasquale Avella & Maurizio Boccia & Laurence A. Wolsey, 2018. "Single-Period Cutting Planes for Inventory Routing Problems," Transportation Science, INFORMS, vol. 52(3), pages 497-508, June.

    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:inm:oropre:v:21:y:1973:i:1:p:261-269. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.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.