Technical Note—Stronger Inequalities for 0-1 Integer Programming: Computational Refinements

Ferydoon Kianfar
Additional contact information
Ferydoon Kianfar: Arya-Mehr University of Technology, Teheran, Iran

Operations Research, 1976, vol. 24, issue 3, 581-585

Abstract: This paper presents computational refinements to minimize the number of iterations involved in finding stronger cuts and constraints for 0-1 integer programming by the method presented in an earlier paper, “Stronger Inequalities for 0, 1 integer Programming Using Knapsack Functions.” We show that the savings in number of iterations between an optimally-sequenced cut-strengthening procedure and the procedure of the author's earlier paper can be very substantial. For example, for strengthening a cut with 200 0-1 variables this reduction can be 17,250 iterations.

Date: 1976
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.24.3.581 (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:24:y:1976:i:3:p:581-585

Access Statistics for this article

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