Please use this identifier to cite or link to this item:
https://elib.bsu.by/handle/123456789/258192| Title: | Improved lower bounds for the online bin stretching problem |
| Authors: | Gabay, M. Brauner, N. Kotov, V. |
| Keywords: | ЭБ БГУ::ЕСТЕСТВЕННЫЕ И ТОЧНЫЕ НАУКИ::Математика |
| Issue Date: | 2017 |
| Publisher: | Springer Verlag |
| Citation: | 4OR 2017;15(2):183-199. |
| Abstract: | We use game theory techniques to automatically compute improved lower bounds 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 technique and show that it can be generalized to compute lower bounds for any online or semi-online packing or scheduling problem. |
| URI: | https://elib.bsu.by/handle/123456789/258192 |
| DOI: | 10.1007/s10288-016-0330-2 |
| Scopus: | 84990996884 |
| Appears in Collections: | Статьи факультета прикладной математики и информатики |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| article.pdf | 647,54 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.