Efficient solutions for special zero–one programming problems

A zero–one linear programming is under consideration. It has been proved that for special structures and values of the parameters, the solution of the linear relaxation of the problem is integral and can be either predetermined or computed efficiently. In general, a tight upper bound is provided in order to establish an efficient procedure for solving the problem. The results may have practical implementations in knowledge-management, data-mining, network flow, graph theory, reliability and statistical studies.