In the paper [2] a calculus for solving integer optimization problems which can arithmetico proposition logical was developed. In the present paper these studies are used to obtain procedures for solving integer linear optimization problems based on switching algebra algorithms. These procedures differ both from cutting methods and also the known combinational methods.

Three procedures, which may allow further modifications, are considered.