Discrete Programming by the Filter Method

Egon Balas

Operations Research, 1967, vol. 15, issue 5, 915-957

Abstract: In this paper (section 1) a two-phase procedure, the filter method or accelerated additive algorithm, is proposed for solving linear programs with zero-one variables. In Phase I an auxiliary problem is constructed that, in Phase II, is used to “filter” the solutions to which the tests of the additive algorithm are to be applied. The filter method is then extended (section 2) by J. F. Benders’ partitioning procedure to the mixed-integer zero-one case, as well as to general integer and mixed-integer programs. Finally, a specialized version of this method is used (section 3) to tackle a general machine-sequencing model, formulated as the problem of finding a minimaximal path in a disjunctive graph.

Date: 1967
References: Add references at CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.15.5.915 (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:15:y:1967:i:5:p:915-957

Access Statistics for this article

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