IDEAS home Printed from https://ideas.repec.org/a/wly/navlog/v20y1973i3p469-476.html
   My bibliography  Save this article

Using decomposition in integer programming

Author

Listed:
  • Linus Schrage

Abstract

When implicit enumeration algorithms are used for solving integer programs, a form of primal decomposition can be used to reduce the number of solutions which must be implicitly examined. If the problem has the proper structure, then under the proper decomposition a different enumeration tree can be defined for which the number of solutions which must be implicitly examined increases with a power of the number of variables rather then exponentially. The proper structure for this kind of decomposition is that the southwest and northeast corners of the constraint matrix be zero or equivalently that the matrix be decomposable except for linking columns. Many real traveling salesmen, plant location, production scheduling, and covering problems have this structure.

Suggested Citation

  • Linus Schrage, 1973. "Using decomposition in integer programming," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 20(3), pages 469-476, September.
    • Handle: RePEc:wly:navlog:v:20:y:1973:i:3:p:469-476
    DOI: 10.1002/nav.3800200309
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.3800200309
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.3800200309?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
    ---><---

    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:wly:navlog:v:20:y:1973:i:3:p:469-476. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1931-9193 .

    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.