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

Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem

Author

Listed:
  • Moustapha Diaby

    (Arizona State University, Tempe, Arizona)

Abstract

We present an implicit enumeration procedure for solving pure integer 0/1 minimax problems which arise in the context of Benders decomposition for mixed integer 0/1 linear programming problems, or in various practical settings such as the location of facilities and assembly line balancing. The procedure is an extension of the additive algorithm of E. Balas for pure integer 0/1 programming problems. We solve minimax problems directly (i.e., as minimax problems, not as mixed integer programming problems). A numerical example is used to illustrate the procedure. Extensions of the basic algorithm are discussed.

Suggested Citation

  • Moustapha Diaby, 1993. "Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem," Operations Research, INFORMS, vol. 41(6), pages 1172-1176, December.
    • Handle: RePEc:inm:oropre:v:41:y:1993:i:6:p:1172-1176
    DOI: 10.1287/opre.41.6.1172
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.41.6.1172
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.41.6.1172?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. Hadi Bidhandi, 2006. "A new approach based on the surrogating method in the project time compression problems," Annals of Operations Research, Springer, vol. 143(1), pages 237-250, March.
    2. Qinghua Zhang, 2013. "A new necessary and sufficient global optimality condition for canonical DC problems," Journal of Global Optimization, Springer, vol. 55(3), pages 559-577, March.

    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:41:y:1993:i:6:p:1172-1176. 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.