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

A Method of Decomposition for Integer Programs

Author

Listed:
  • Dennis J. Sweeney

    (University of Cincinnati, Cincinnati, Ohio)

  • Richard A. Murphy

    (University of Cincinnati, Cincinnati, Ohio)

Abstract

A method of decomposing integer programs with block angular structure is presented. It is based on the notion of searching for the optimal solution to an integer program among the near-optimal solutions to its Lagrangian relaxation. An optimality theorem is obtained and a generic decomposition algorithm is presented. An application of this approach is discussed and some computational results are reported.

Suggested Citation

  • Dennis J. Sweeney & Richard A. Murphy, 1979. "A Method of Decomposition for Integer Programs," Operations Research, INFORMS, vol. 27(6), pages 1128-1141, December.
  • Handle: RePEc:inm:oropre:v:27:y:1979:i:6:p:1128-1141
    DOI: 10.1287/opre.27.6.1128
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.27.6.1128
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.27.6.1128?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. Rönnberg, Elina & Larsson, Torbjörn, 2014. "All-integer column generation for set partitioning: Basic principles and extensions," European Journal of Operational Research, Elsevier, vol. 233(3), pages 529-538.
    2. Albrecht, Martin & Stadtler, Hartmut, 2015. "Coordinating decentralized linear programs by exchange of primal information," European Journal of Operational Research, Elsevier, vol. 247(3), pages 788-796.
    3. Torbjörn Larsson & Michael Patriksson, 2006. "Global Optimality Conditions for Discrete and Nonconvex Optimization---With Applications to Lagrangian Heuristics and Column Generation," Operations Research, INFORMS, vol. 54(3), pages 436-453, June.
    4. Sonmez, Ayse Durukan & Lim, Gino J., 2012. "A decomposition approach for facility location and relocation problem with uncertain number of future facilities," European Journal of Operational Research, Elsevier, vol. 218(2), pages 327-338.
    5. Syam Menon & Linus Schrage, 2002. "Order Allocation for Stock Cutting in the Paper Industry," Operations Research, INFORMS, vol. 50(2), pages 324-332, April.

    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:27:y:1979:i:6:p:1128-1141. 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.