nteger programming . Wiley, New York, 0000. MATH  Q. Wu and J.-K. Hao. A memetic approach for the Max-Cut problem. In C.A.C. Coello, V. Cutello, K. Deb, S. Forrest, G. Nicosia, and M. Pavone, editors, Parallel problem solving from nature - Part II , volume 0000 of Lecture Notes in Computer Science , pages 000-000. Springer, Berlin, 0000.  F.P. Wyman. Binary programming: A occasion rule for selecting optimal vs. heuristic techniques. The Computer Journal