Generating cuts in integer programming with families of special ordered sets (Q922293)

The author describes families of cuts which can be added to integer programming problems incorporating special ordered sets. Ways in which the cuts can be used to attempt to narrow the gap between a continuous optimum and a feasible integer solution at any stage in the branch-and- bound method are discussed and some computational experience is presented. The main fault of the paper is the lack of a complete and precise problem formulation as well as any assertion concerning the properties of the described cuts.