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

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.