ANOR

2005

13 years 10 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 ...

EOR

2007

13 years 10 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ï...

EOR

2006

13 years 10 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...

ENDM

2010

13 years 10 months ago
2010

We study an extension of the precedence constrained knapsack problem where the knapsack can be filled in multiple periods. This problem is known in the mining industry as the open...

FOCS

2004

IEEE

14 years 1 months ago
2004

IEEE

We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...

GECCO

2005

Springer

14 years 3 months ago
2005

Springer

Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more eï¬€ective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...