77 search results - page 3 / 16 » Test Sets and Inequalities for Integer Programs |
IPCO
2004
13 years 9 months ago
2004
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...
JGO
2008
13 years 7 months ago
2008
Two-stage stochastic mixed-integer programming (SMIP) problems with recourse are generally difficult to solve. This paper presents a first computational study of a disjunctive cut...
IOR
2010
13 years 6 months ago
2010
This paper introduces disjunctive decomposition for two-stage mixed 0-1 stochastic integer programs (SIPs) with random recourse. Disjunctive decomposition allows for cutting plane...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Integer octagonal constraints (a.k.a. Unit Two Variables Per Inequality or UTVPI integer constraints) constitute an interesting class of constraints for the representation and solu...
ICCD
2003
IEEE
14 years 4 months ago
2003
IEEE
We discuss the compaction of independent test sequences for sequential circuits. Our first contribution is the formulation of this problem as an integer program, which we then so...