An Approximation Technique for Pseudo-Boolean Maximization Problems
Robert P. Davis, Miriam Terrell · A I I E Transactions · 1976
A partitioning procedure is proposed for obtaining approximate solutions to pseudo-Boolean optimization problems (e.g., zero-one polynomial programs). Such a procedure is useful not only in its ability to provide a bound value but further as a means for initializing optimum seeking methods, such as implicit enumeration techniques, employed to insure optimality.