Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

EOR
2008

favoriteEmaildiscussreport

123views more EOR 2008»

An asymptotic approximation scheme for the concave cost bin packing problem

13 years 4 months ago

An asymptotic approximation scheme for the concave cost bin packing problem

Download repository.lib.polyu.edu.hk

Joseph Y.-T. Leung, Chung-Lun Li

Real-time Traffic

EOR 2008 |

claim paper

Related Content

» Asymptotic fully polynomial approximation schemes for variants of openend bin packing

» The Train Delivery Problem Vehicle Routing Meets Bin Packing

» Approximation schemes for multidimensional packing

» Better approximation algorithms for bin covering

» Bin Packing with Rejection Revisited

» On strip packing With rotations

Post Info
More Details (n/a)

Added	10 Dec 2010
Updated	10 Dec 2010
Type	Journal
Year	2008
Where	EOR
Authors	Joseph Y.-T. Leung, Chung-Lun Li

Comments (0)