Comparing the costs of Any Fit algorithms for bin packing

Research output: Contribution to journalArticlepeer-review

Abstract

An online bin packing instance is a list of item sizes each of which is a rational number in (0,1], the goal is to partition the items into bins where the total size of items in a bin is at most 1, and the total number of bins is minimized. Here we analyze the ratio of two online algorithms for sequences where the total size of items is large and prove an old open conjecture of Johnson.

Original languageEnglish
Pages (from-to)646-649
Number of pages4
JournalOperations Research Letters
Volume50
Issue number6
DOIs
StatePublished - Nov 2022
Externally publishedYes

Keywords

  • Analysis of algorithms
  • Bin packing
  • Online algorithms
  • Worst-case analysis

All Science Journal Classification (ASJC) codes

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Comparing the costs of Any Fit algorithms for bin packing'. Together they form a unique fingerprint.

Cite this