18 search results - page 1 / 4 » On the Exact Separation of Mixed Integer Knapsack Cuts |
IPCO
2007
14 years 18 days ago
2007
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
IPCO
2004
14 years 16 days 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...
ANOR
2002
13 years 11 months ago
2002
We use surrogate analysis and constraint pairing in multidimensional knapsack problems to fix some variables to zero and to separate the rest into two groups
ANOR
2007
13 years 11 months ago
2007
In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer roun...
MP
2002
13 years 10 months ago
2002
The bounded multiple-class binary knapsack problem is a variant of the knapsack problem where the items are partitioned into classes and the item weights in each class are a multip...