Mixed zero-one Programming

For students familiar with linear programming, we give here a brief account of the basic exact solution technique used for general problems of this kind: branch and bound. Other techniques supplement it, such a cutting planes, branch and cut, etc. This topic is a vast and highly complex field of study, about which an enormous literature exists. A good introduction is found in Wolsey (1998). One of the most comprehensive references is Nemhauser and Wolsey (1988)