An aptas for generalized cost variable-sized bin packing

SIAM Journal on Computing

Volumn 38, Issue 1, 2008, Pages 411-428

  Epstein, Leah ^a   Levin, Asaf ^b  

^a UNIVERSITY OF HAIFA   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Approximation algorithm; Bin packing; Worst case analysis

Indexed keywords

APPROXIMATION ALGORITHMS; COST ACCOUNTING; COSTS; POLYNOMIAL APPROXIMATION;

ALLOCATION METHODS; APPLICATIONS.; BIN PACKING; BIN PACKING PROBLEMS; BIN PACKINGS; BIN SIZES; FIXED COSTS; GENERALIZED COSTS; POLYNOMIAL TIME APPROXIMATION SCHEMES; SIMPLE MODELS; WORST CASE ANALYSIS;

BINS;

EID: 55249102193     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/060670328     Document Type: Article

References (14)

1. E. G. COFFMAN, M. R. GAREY, AND D. S. JOHNSON, Approximation algorithms for bin packing: A survey, in Approximation Algorithms, D. Hochbaum, ed., PWS Publishing, New York, 1997.
2. J. CSIRIK, An online algorithm for variable-sized bin packing, Acta Inform., 26 (1989), pp. 697-709.
3. W. FERNANDEZ DE LA VEGA AND G. S. LUEKER, Bin packing can be solved within 1 + ε{lunate} in linear time, Combinatorica, 1 (1981), pp. 349-355.
4. D. K. FRIESEN AND M. A. LANGSTON, Variable sized bin packing, SIAM J. Comput., 15 (1986), pp. 222-230.
5. M. R. GAREY, R. L. GRAHAM, AND J. D. ULLMAN, Worst-case analysis of memory allocation algorithms, in Proceedings of the 4th Symposium on Theory of Computing (STOC'72), 1972, pp. 143-150.
6. D. S. HOCHBAUM AND D. B. SHMOYS, A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach, SIAM J. Comput., 17 (1988), pp. 539-551.
7. D. S. JOHNSON, Near-Optimal Bin Packing Algorithms, Ph.D. thesis, MIT, Cambridge, MA, 1973.
8. H. W. LENSTRA, JR., Integer programming with a fixed number of variables, Math. Oper. Res., 8 (1983), pp. 538-548.
9. J. KANG AND S. PARK, Algorithms for the variable sized bin packing problem, European J. Oper. Res., 147 (2003), pp. 365-372.
10. N. KARMARKAR AND R. M. KARP, An efficient approximation scheme for the one-dimensional bin-packing problem, in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS'82), 1982, pp. 312-320.
11. C.-L. LI AND Z.-L. CHEN, Bin-packing problem with concave costs of bin utilization. Naval Res. Logist., 53 (2006), pp. 298-308.
12. F. D. MURGOLO, An efficient approximation scheme for variable-sized bin packing, SIAM J. Comput., 16 (1987), pp. 149-161.
13. S. S. SEIDEN, An optimal online algorithm for bounded space variable-sized bin packing, SIAM J. Discrete Math., 14 (2001), pp. 458-470.
14. S. S. SEIDEN, R. VAN STEE, AND L. EPSTEIN, New bounds for variable-sized online bin packing, SIAM J. Comput., 32 (2003). pp. 455-469.