메뉴 건너뛰기




Volumn 183, Issue 3, 2007, Pages 1295-1303

Computing the asymptotic worst-case of bin packing lower bounds

Author keywords

Asymptotic worst case analysis; Bin Packing lower bounds; Packing

Indexed keywords

ASYMPTOTIC ANALYSIS; BOUNDARY CONDITIONS; COMPUTATIONAL METHODS; PROBLEM SOLVING;

EID: 34447095926     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.07.032     Document Type: Article
Times cited : (11)

References (10)
  • 2
    • 0008200674 scopus 로고    scopus 로고
    • Bin packing approximation algorithms: A survey
    • Hochbaum D. (Ed), PWS Publishing Company, Boston, MA
    • Coffman E., Garey M., and Johnson D. Bin packing approximation algorithms: A survey. In: Hochbaum D. (Ed). Approximation Algorithms for NP-Hard Problems (1996), PWS Publishing Company, Boston, MA 46-93
    • (1996) Approximation Algorithms for NP-Hard Problems , pp. 46-93
    • Coffman, E.1    Garey, M.2    Johnson, D.3
  • 3
    • 34447108168 scopus 로고    scopus 로고
    • T.G. Crainic, G. Perboli, M. Pezzuto, R. Tadei, New bin packing fast lower bounds, Computers and Operations Research, in press.
  • 4
    • 0012575285 scopus 로고    scopus 로고
    • New classes of lower bounds for bin packing problems
    • Fekete S., and Schepers J. New classes of lower bounds for bin packing problems. Mathematical Programming 91 1 (2001) 11-31
    • (2001) Mathematical Programming , vol.91 , Issue.1 , pp. 11-31
    • Fekete, S.1    Schepers, J.2
  • 5
    • 34447104704 scopus 로고    scopus 로고
    • D. Johnson, Near-Optimal Bin Packing Algorithms, Ph.D. thesis, Dept. of Mathematics, M.I.T., Cambridge, MA, 1973.
  • 8
    • 38249020984 scopus 로고
    • Lower bounds and reduction procedures for the bin packing problem
    • Martello S., and Toth P. Lower bounds and reduction procedures for the bin packing problem. Discrete Applied Mathematics 28 1 (1990) 59-70
    • (1990) Discrete Applied Mathematics , vol.28 , Issue.1 , pp. 59-70
    • Martello, S.1    Toth, P.2
  • 9
    • 34447106411 scopus 로고    scopus 로고
    • G. Perboli, Bounds and heuristics for the packing problems, Ph.D. thesis, Politecnico di Torino. Available from: (2002).
  • 10
    • 34447100387 scopus 로고    scopus 로고
    • G. Wäscher, H. Haussner, H. Schumann, An improved typology of cutting and packing problems, European Journal of Operational Research, this issue, doi:10.1016/j.ejor.2005.12.047.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.