A robust APTAS for the classical bin packing problem

Leah Epstein; Asaf Levin

doi:10.1007/s10107-007-0200-y

A robust APTAS for the classical bin packing problem

Leah Epstein, Asaf Levin

Department of Mathematics

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	33-49
Number of pages	17
Journal	Mathematical Programming
Volume	119
Issue number	1
DOIs	https://doi.org/10.1007/s10107-007-0200-y
State	Published - Jun 2009

ASJC Scopus subject areas

Software
General Mathematics

Access to Document

10.1007/s10107-007-0200-y

Cite this

@article{ea9742229a774ccb9b5ff44598b3d619,

title = "A robust APTAS for the classical bin packing problem",

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.",

author = "Leah Epstein and Asaf Levin",

year = "2009",

month = jun,

doi = "10.1007/s10107-007-0200-y",

language = "English",

volume = "119",

pages = "33--49",

journal = "Mathematical Programming",

issn = "0025-5610",

publisher = "Springer-Verlag GmbH and Co. KG",

number = "1",

}

TY - JOUR

T1 - A robust APTAS for the classical bin packing problem

AU - Epstein, Leah

AU - Levin, Asaf

PY - 2009/6

Y1 - 2009/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=60449089900&partnerID=8YFLogxK

U2 - 10.1007/s10107-007-0200-y

DO - 10.1007/s10107-007-0200-y

M3 - Article

AN - SCOPUS:60449089900

SN - 0025-5610

VL - 119

SP - 33

EP - 49

JO - Mathematical Programming

JF - Mathematical Programming

IS - 1

ER -

A robust APTAS for the classical bin packing problem

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this