
For the zero-one integer programming problem an approximate method using the idea of the subgradient descent is presented. Simultaneously, the deviation of the approximate solution from the optimal is estimated.
Combinatorial optimization, Numerical mathematical programming methods, approximate method, deviation estimation, error estimation, subgradient descent, Boolean programming
Combinatorial optimization, Numerical mathematical programming methods, approximate method, deviation estimation, error estimation, subgradient descent, Boolean programming
