2061 search results - page 1 / 413 » The continuous knapsack set |
ANOR
2005
13 years 4 months ago
2005
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0-1 knapsack set, the mixed 0-1 knapsack set, the integer ...
ANOR
2007
13 years 4 months ago
2007
In this survey we attempt to give a uniļ¬ed presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer roun...
MOR
2002
13 years 4 months ago
2002
We present a polyhedral study of the complementarity knapsack problem. Traditionally, complementarity constraints are modeled by introducing auxiliary binary variables and additio...
EOR
2006
13 years 4 months ago
2006
We are concerned with a variation of the knapsack problem as well as of the knapsack sharing problem, where we are given a set of n items and a knapsack of a fixed capacity. As us...
EOR
2007
13 years 4 months ago
2007
The knapsack problem (KP) is generalized to the case where items are partially ordered through a set of precedence relations. As in ordinary KPs, each item is associated with proļ...