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

Moustapha Diaby
Additional contact information
Moustapha Diaby: Arizona State University, Tempe, Arizona

Operations Research, 1993, vol. 41, issue 6, 1172-1176

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.

Keywords: production/scheduling: production line balancing; programming; integer; algorithms: Benders decomposition (search for similar items in EconPapers)
Date: 1993
References: Add references at CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.41.6.1172 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:41:y:1993:i:6:p:1172-1176

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().