To cite this record:
Worst-case analyses, linear programming and the bin-packing problem
Chan, Lap Mui Ann
Simchi-Levi, David
Bramel, Julien

Date: 1998
Abstract: In this paper we consider the familiar bin-packing problem and its associated set-partitioning formulation. We show that the optimal solution to the bin-packing problem can be no larger than 4/3.
Language: Anglès.
Document: Article ; recerca ; article ; publishedVersion
Subject: Absolute performance ratio ; Bin-packing ; Linear programming ; Best-fit decreasing ; First-fit decreasing
Published in: Mathematical Programming, vol. 83 n. 2 (1998) p. 213-227, ISSN 0025-5610

15 p, 623.1 KB
 UAB restricted access

The record appears in these collections:
Articles > Published articles

 Record created 2006-03-13, last modified 2015-01-07

   Favorit i Compartir
QR image