메뉴 건너뛰기




Volumn 160, Issue 7-8, 2012, Pages 1291-1297

The stochastic generalized bin packing problem

Author keywords

Deterministic approximation; Extreme values; Generalized bin packing; Random item profit

Indexed keywords

ASYMPTOTIC THEORIES; AVAILABILITY CONSTRAINTS; DETERMINISTIC APPROXIMATION; EXTREME VALUE; GENERALIZED BIN PACKING; NET PROFITS; PACKING PROBLEMS; TOTAL COSTS;

EID: 84858863150     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2011.10.037     Document Type: Article
Times cited : (25)

References (14)
  • 2
    • 79952984509 scopus 로고    scopus 로고
    • Efficient lower bounds and heuristics for the variable cost and size bin packing problem
    • 10.1016/j.cor.2011.01.001
    • T.G. Crainic, G. Perboli, W. Rei, and R. Tadei Efficient lower bounds and heuristics for the variable cost and size bin packing problem Computers & Operations Research 38 2011 1474 1482 10.1016/j.cor.2011.01.001
    • (2011) Computers & Operations Research , vol.38 , pp. 1474-1482
    • Crainic, T.G.1    Perboli, G.2    Rei, W.3    Tadei, R.4
  • 3
    • 61449225483 scopus 로고    scopus 로고
    • Approximating the stochastic knapsack problem: The benefit of adaptivity
    • B. Dean, M. Goemans, and J. Vondrak Approximating the stochastic knapsack problem: The benefit of adaptivity Mathematics of Operations Research 33 2008 945 964
    • (2008) Mathematics of Operations Research , vol.33 , pp. 945-964
    • Dean, B.1    Goemans, M.2    Vondrak, J.3
  • 8
    • 80051782968 scopus 로고    scopus 로고
    • On two-stage stochastic knapsack problems
    • 10.1016/j.dam.2010.04.006
    • S. Kosuch, and A. Lisser On two-stage stochastic knapsack problems Discrete Applied Mathematics 159 16 2011 1827 1841 10.1016/j.dam.2010.04.006
    • (2011) Discrete Applied Mathematics , vol.159 , Issue.16 , pp. 1827-1841
    • Kosuch, S.1    Lisser, A.2
  • 11
    • 0006262885 scopus 로고
    • On-line bin packing of items of random size, Part i
    • W.T. Rhee, and M. Talagrand On-line bin packing of items of random size, Part I SIAM Journal on Computing 18 1993 438 445
    • (1993) SIAM Journal on Computing , vol.18 , pp. 438-445
    • Rhee, W.T.1    Talagrand, M.2
  • 12
    • 0024680501 scopus 로고
    • On-line bin packing of items of random size, Part II
    • W.T. Rhee, and M. Talagrand On-line bin packing of items of random size, Part II SIAM Journal on Computing 18 1993 473 486
    • (1993) SIAM Journal on Computing , vol.18 , pp. 473-486
    • Rhee, W.T.1    Talagrand, M.2
  • 14
    • 0036475535 scopus 로고    scopus 로고
    • A heuristic algorithm for the auto-carrier transportation problem
    • DOI 10.1287/trsc.36.1.55.567
    • R. Tadei, G. Perboli, and F. Della Croce A heuristic algorithm for the auto-carrier transportation problem Transportation Science 36 1 2002 55 62 (Pubitemid 34268733)
    • (2002) Transportation Science , vol.36 , Issue.1 , pp. 55-62
    • Tadei, R.1    Perboli, G.2    Della Croce, F.3


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