A robust APTAS for the classical bin packing problem

Leah Epstein, Asaf Levin

Research output: Contribution to journalArticlepeer-review

Abstract

Bin packing is a well studied problem which has many applications. In this paper we design a robust APTAS for the problem. The robust APTAS receives a single input item to be added to the packing at each step. It maintains an approximate solution throughout this process, by slightly adjusting the solution for each new item. At each step, the total size of items which may migrate between bins must be bounded by a constant factor times the size of the new item. We show that such a property cannot be maintained with respect to optimal solutions.

Original languageEnglish
Pages (from-to)33-49
Number of pages17
JournalMathematical Programming
Volume119
Issue number1
DOIs
StatePublished - Jun 2009

ASJC Scopus subject areas

  • Software
  • Mathematics (all)

Fingerprint

Dive into the research topics of 'A robust APTAS for the classical bin packing problem'. Together they form a unique fingerprint.

Cite this