Improved lower bounds for the online bin stretching problem

Michaël Gabay (), Nadia Brauner () and Vladimir Kotov ()
Additional contact information
Michaël Gabay: Univ. Grenoble Alpes, CNRS, G-SCOP
Nadia Brauner: Univ. Grenoble Alpes, CNRS, G-SCOP
Vladimir Kotov: Belarusian State University

4OR, 2017, vol. 15, issue 2, No 4, 183-199

Abstract: 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.

Keywords: Bin stretching; Scheduling; Online algorithms; Lower bounds; 90B35; 68W27; 05B40 (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10288-016-0330-2 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:aqjoor:v:15:y:2017:i:2:d:10.1007_s10288-016-0330-2

Ordering information: This journal article can be ordered from
https://www.springer ... ch/journal/10288/PSE

DOI: 10.1007/s10288-016-0330-2

Access Statistics for this article

4OR is currently edited by Yves Crama, Michel Grabisch and Silvano Martello

More articles in 4OR from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().