Sciweavers

IPCO
2004
93views Optimization» more  IPCO 2004»
13 years 6 months ago
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 o...
I. R. de Farias