Sciweavers

ANOR
2005
94views more  ANOR 2005»
13 years 10 months ago
Cover and Pack Inequalities for (Mixed) Integer Programming
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 ...
Alper Atamtürk
EOR
2007
111views more  EOR 2007»
13 years 10 months ago
A pegging approach to the precedence-constrained knapsack problem
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ï...
Byungjun You, Takeo Yamada
EOR
2006
73views more  EOR 2006»
13 years 10 months ago
An exact algorithm for the knapsack sharing problem with common items
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...
Masako Fujimoto, Takeo Yamada
ENDM
2010
100views more  ENDM 2010»
13 years 10 months ago
Large-scale multi-period precedence constrained knapsack problem: A mining application
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...
Eduardo Moreno, Daniel G. Espinoza, Marcos Goycool...
FOCS
2004
IEEE
14 years 1 months ago
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
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...
Brian C. Dean, Michel X. Goemans, Jan Vondrá...
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 3 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom