A branch-and-cut method for 0-1 mixed convex programming
- 949 Downloads
We generalize the disjunctive approach of Balas, Ceria, and Cornuéjols  and devevlop 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 Sherali and Adams  and Lovász and Schrijver  for the convex case. Finally, we give some preliminary computational results for our method.
Unable to display preview. Download preview PDF.