IMPLICIT ENUMERATION FOR THE PURE INTEGER 0/1 MINIMAX PROGRAMMING PROBLEM
成果类型：
Note
署名作者：
DIABY, M
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.41.6.1172
发表日期：
1993
页码：
1172-1176
关键词：
摘要：
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.