Improved lower bounds for the online bin stretching problem
Résumé
We use game theory techniques to automatically compute improved lowerbounds on the competitive ratio for the bin stretching problem. Using these techniques,we improve the best lower bound for this problem to 19/14. We explain the techniqueand show that it can be generalized to compute lower bounds for any online or semi-online packing or scheduling problem.