Direct Search Algorithms for Zero-One and Mixed-Integer Programming

Carlton E. Lemke and Kurt Spielberg
Additional contact information
Carlton E. Lemke: IBM Corporation, New York, New York
Kurt Spielberg: IBM Corporation, New York, New York

Operations Research, 1967, vol. 15, issue 5, 892-914

Abstract: A method of solution for the mixed integer-programming problem is proposed. It is based on an exhaustive search of the integer variables, coupled with an efficient use of the product form of the basis matrix inverse, for the linear programming calculations. In this connection a detailed algorithm for the (0 − 1) problem is developed and experimental results are discussed.

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

Downloads: (external link)
http://dx.doi.org/10.1287/opre.15.5.892 (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:892-914

Access Statistics for this article

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