10 search results - page 1 / 2 » A note on the approximability of cutting stock problems |
65
Voted
EOR
2007
14 years 10 months ago
2007
COLOGNETWENTE
2008
14 years 11 months ago
2008
113
click to vote
EOR
2007
14 years 10 months ago
2007
In this paper, we study different strategies to stabilize and accelerate the column generation method, when it is applied specifically to the variable sized bin-packing problem,...
102
click to vote
ECCC
2000
14 years 10 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
112
click to vote
ORL
2006
14 years 10 months ago
2006
The strategic safety stock placement problem is a constrained separable concave minimization problem and so is solvable, in principle, as a sequence of mixed-integer programming p...