A branch-and-cut method for 0-1 mixed convex programming

We generalize the disjunctive approach of Balas, Ceria, and Cornuejols [2] and develop a branch-and-cut method for solving 0-1 convex programming problems. We show that cuts can be generated by solving a single convex program. We show how to construct regions similar to those of Sherari and Adams [20] and Lovasz and Schrijver [12] for the convex case. Finally, we give some preliminary computational results for our method.