A robust APTAS for the classical bin packing problem

被引：27

作者：

Epstein, Leah ^{[2
]}

Levin, Asaf ^{[1
]}

机构：

[1] Hebrew Univ Jerusalem, Dept Stat, IL-91905 Jerusalem, Israel

[2] Univ Haifa, Dept Math, IL-31905 Haifa, Israel

来源：

MATHEMATICAL PROGRAMMING | 2009年 / 119卷 / 01期

关键词：

ALGORITHMS; TIME;

D O I：

10.1007/s10107-007-0200-y

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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.

引用

页码：33 / 49

页数：17

共 50 条

[1] A robust APTAS for the classical bin packing problem
Leah Epstein
Asaf Levin
Mathematical Programming, 2009, 119 : 33 - 49
[2] A robust APTAS for the classical bin packing problem
Epstein, Leah
Levin, Asaf
AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 214 - 225
[3] An APTAS for Bin Packing with Clique-Graph Conflicts
Doron-Arad, Ilan
Kulik, Ariel
Shachnai, Hadas
ALGORITHMS AND DATA STRUCTURES, WADS 2021, 2021, 12808 : 286 - 299
[4] There is no APTAS for 2-dimensional vector bin packing: Revisited
Ray, Arka
INFORMATION PROCESSING LETTERS, 2024, 183
[5] An aptas for generalized cost variable-sized bin packing
Epstein, Leah
Levin, Asaf
SIAM JOURNAL ON COMPUTING, 2008, 38 (01) : 411 - 428
[6] Hybrid Quantum-Classical Heuristic for the Bin Packing Problem
de Andoin, Mikel Garcia
Osaba, Eneko
Oregi, Izaskun
Villar-Rodriguez, Esther
Sanz, Mikel
PROCEEDINGS OF THE 2022 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION, GECCO 2022, 2022, : 2214 - 2222
[7] The robust machine availability problem - bin packing under uncertainty
Song, Guopeng
Kowalczyk, Daniel
Leus, Roel
IISE TRANSACTIONS, 2018, 50 (11) : 997 - 1012
[8] On the online bin packing problem
Seiden, SS
JOURNAL OF THE ACM, 2002, 49 (05) : 640 - 671
[9] On the online bin packing problem
Seiden, SS
AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 237 - 248
[10] Bin packing problem with scenarios
Attila Bódis
János Balogh
Central European Journal of Operations Research, 2019, 27 : 377 - 395

← 1 2 3 4 5 →