2016•4OROpen access
Improved lower bounds for the online bin stretching problem
Michaël Gabay, Nadia Brauner, В. М. Котов
Open full text 11 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Michaël Gabay, Nadia Brauner, В. М. Котов
Abstract
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 11 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Bin, Bin packing problem, Online algorithm, Upper and lower bounds, Competitive analysis, Mathematical optimization, Computer science, Scheduling (production processes)