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

Abstract
No abstract available