On the Maximization of a Pseudo-Boolean Function
Peter L. Hammer, Uri N. Peled · Journal of the ACM · 1972
A branch-and-bound method is proposed for the maximization of real valued functions with variables assuming only the values 0 and 1.The importance of the problem consists-as has been shown by Hammer and Rudeanu-in the fact that numerous problems in operations research, graph theory, combinatorial mathematics, etc., can be brought to this form.The method has been successfully tested on an IBM 360/50 computer.