Worst-case analysis of the subset sum algorithm for bin packing

Authors:
Alberto Caprara;Ulrich Pferschy
Affiliations:
DEIS, Dipartimento di Elettronica, Informatica e Sistemistica, University of Bologna, Viale Risorgimento 2, I-40136 Bologna, Italy;Department of Statistics and Operations Research, University of Graz, Universitaetsstr. 15, A-8010 Graz, Austria
Venue:
Operations Research Letters
Year:
2004

Citing 6
Cited 9

Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Dynamic programming revisited: improving knapsack algorithms

Computing - Special issue on combinatorial optimization
Linear time algorithms for knapsack problems with bounded weights

Journal of Algorithms
New heuristics for one-dimensional bin-packing

Computers and Operations Research
Bounds on multiprocessing anomalies and related packing algorithms

AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Fast algorithms for bin packing

Journal of Computer and System Sciences

Modified subset sum heuristics for bin packing

Information Processing Letters
Bin Packing of Selfish Items

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Heuristics for the variable sized bin-packing problem

Computers and Operations Research
Parametric Packing of Selfish Items and the Subset Sum Algorithm

WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Modified subset sum heuristics for bin packing

Information Processing Letters
Reconfiguration and Communication-Aware Task Scheduling for High-Performance Reconfigurable Computing

ACM Transactions on Reconfigurable Technology and Systems (TRETS)
Relaxations and exact solution of the variable sized bin packing problem

Computational Optimization and Applications
Efficient algorithms for real-life instances of the variable size bin packing problem

Computers and Operations Research
Online variable-sized bin packing with conflicts

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We analyze the worst-case ratio of a natural heuristic for the bin packing problem, which proceeds by filling one bin at a time, each as much as possible. We show a nontrivial upper bound on this ratio of 43+ln43=1.6210..., almost matching a known lower bound.