Citation
New Lower Bound for the Bin Packing Problem. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 234-241, 2007.
Paper
Abstract
In this paper, we present new classes of lower bound for the one-dimensional bin packing problem, we prove that the worst-case asymptotic performance ratio of this bound is 3/4. Extensive numerical experiments show that this new bound outperforms the best lower bounds from the literature.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2007-234-241-P, author = {B. Jarboui},
title = {New Lower Bound for the Bin Packing Problem},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {234--241},
note = {Paper},
abstract = {In this paper, we present new classes of lower bound for the one-dimensional bin packing problem, we prove that the worst-case asymptotic performance ratio of this bound is 3/4. Extensive numerical experiments show that this new bound outperforms the best lower bounds from the literature.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2007-234-241-P.pdf} }