Semi-continuous Cuts for Mixed-Integer Programming

We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its own right, the semi-continuous knapsack problem is a relaxation of general mixed-integer programming. We show how strong inequalities valid for the semi-continuous knapsack polyhedron can be derived and used in a branch-and-cut scheme for mixed-integer programming and problems with semi-continuous variables. We present computational results that demonstrate the e

• Type: Conference
• Year: 2004
• Where: IPCO
• Authors: I. R. de Farias
• Keywords: IPCO 2004, IPCO 2007, Semi-continuous, Semi-continuous Knapsack, Semi-continuous Knapsack Problem