An Approximation Algorithm for Nonlinear 0-1 Integer Programming Problems

This paper suggests an approximate algorithm to solve general 0-1 integer programming problems. This algorithm belongs to the class of lexicographic enumeration algorithms. Theoretical analysis and a strict mathematical proof of convergence property of the algorithm are presented , as well as experimental investigation to engineering structural optimization with good results.