Sciweavers

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

124

Voted

ESCAPE
2007
Springer

256views Algorithms» more ESCAPE 2007»

A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection

15 years 9 months ago

A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection

Download www.dii.uchile.cl

Wolfgang W. Bein, José R. Correa, Xin Han

Real-time Traffic

Algorithms | ESCAPE 2007 |

claim paper

Related Content

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

» Bin Packing with Rejection Revisited

» An asymptotic approximation scheme for the concave cost bin packing problem

» Approximation schemes for multidimensional packing

» Better approximation algorithms for bin covering

» The Train Delivery Problem Vehicle Routing Meets Bin Packing

» On strip packing With rotations

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	ESCAPE
Authors	Wolfgang W. Bein, José R. Correa, Xin Han

Comments (0)