Generalized Covering Relaxation for 0-1 Programs.
Daniel Granot, Frieda Granot · Defense Technical Information Center (DTIC) · 1978
A general purpose algorithm is constructed for solving polynomial 0-1 programming problems. The algorithm is applied directly to the polynomial problem in its original form. Further, no additional variables are introduced in the solution process. The algorithm was tested on randomly generated modest size problems and the preliminary computational results obtained are very encouraging.