A heuristic 0-1 integer programming method (Q1190388)

A heuristic method is described for the following problem: given \(A\in\{- 1,0,+1\}^{m\times N}\), \(b\in Z^ m\), \(N>m\), find \(x\in\{0,1\}^ N\) such that \(Ax=b\). The method is based on a general search strategy which enables search paths to be followed or abandoned according to their heuristic likelihood of leading to a solution. Based on two rules pertaining to the strategy an algorithm requires for large search trees a linear execution time with respect to the number of expanded edges is proved. The only major criticism of this interesting paper is that it lacks clearly formulated algorithms.