10 search results - page 1 / 2 » A note on the approximability of cutting stock problems |
84
Voted
EOR
2007
15 years 21 days ago
2007
83
Voted
COLOGNETWENTE
2008
15 years 1 months ago
2008
148
Voted
EOR
2007
15 years 21 days 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,...
118
click to vote
ECCC
2000
15 years 16 days 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...
124
click to vote
ORL
2006
15 years 20 days 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...