메뉴 건너뛰기




Volumn 47, Issue , 2009, Pages 147-164

Solving the maximum cardinality bin packing problem with aweight annealing-based algorithm

Author keywords

Bin packing; Combinatorial optimization; Heuristics; Weight annealing

Indexed keywords


EID: 84888624138     PISSN: 1387666X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-88843-9_8     Document Type: Article
Times cited : (46)

References (11)
  • 1
    • 0021946689 scopus 로고
    • Probabilistic bounds for dual bin-packing
    • J. Bruno, P. Downey. Probabilistic bounds for dual bin-packing, Acta Informatica, 22:333-345, 1985.
    • (1985) Acta Informatica , vol.22 , pp. 333-345
    • Bruno, J.1    Downey, P.2
  • 2
    • 0008785637 scopus 로고
    • Bin packing: Maximizing the number of pieces packed
    • E. Coffman, J. Leung, D. Ting. Bin packing: Maximizing the number of pieces packed, Acta Informatica, 9:263-271, 1978.
    • (1978) Acta Informatica , vol.9 , pp. 263-271
    • Coffman, E.1    Leung, J.2    Ting, D.3
  • 4
    • 0036604755 scopus 로고    scopus 로고
    • New heuristics for one-dimensional bin-packing
    • K. Fleszar, K. Hindi. New heuristics for one-dimensional bin-packing, Computers & Operations Research, 29:821-839, 2002.
    • (2002) Computers & Operations Research , vol.29 , pp. 821-839
    • Fleszar, K.1    Hindi, K.2
  • 5
    • 84958763526 scopus 로고    scopus 로고
    • A polynomial time approximation scheme for the multiple knapsack problem
    • in Randomization, (D. Hochbaum, K. Jansen, J. Rolim, and A. Sinclair, editors), Springer, Berlin
    • H. Kellerer. A polynomial time approximation scheme for the multiple knapsack problem, in Randomization, Approximation, and Combinatorial Algorithms and Techniques (D. Hochbaum, K. Jansen, J. Rolim, and A. Sinclair, editors), 51-62, Springer, Berlin, 1999.
    • (1999) Approximation, and Combinatorial Algorithms and Techniques , pp. 51-62
    • Kellerer, H.1
  • 6
    • 0038577482 scopus 로고    scopus 로고
    • Upper bounds and algorithms for the maximum cardinality bin packing problem
    • M. Labbé, G. Laporte, S. Martello. Upper bounds and algorithms for the maximum cardinality bin packing problem, European Journal of Operational Research, 149: 490-498, 2003.
    • (2003) European Journal of Operational Research , vol.149 , pp. 490-498
    • Labbé, M.1    Laporte, G.2    Martello, S.3
  • 9
    • 38249020984 scopus 로고
    • Lower bounds and reduction procedures for the bin-packing problem
    • S. Martello, P. Toth. Lower bounds and reduction procedures for the bin-packing problem, Discrete Applied Mathematics, 26:59-70, 1990.
    • (1990) Discrete Applied Mathematics , vol.26 , pp. 59-70
    • Martello, S.1    Toth, P.2
  • 10
    • 13444267483 scopus 로고    scopus 로고
    • Weight annealing
    • M. Ninio, J. Schneider. Weight annealing, Physica A, 349:649-666, 2005.
    • (2005) Physica A , vol.349 , pp. 649-666
    • Ninio, M.1    Schneider, J.2
  • 11
    • 26844582095 scopus 로고    scopus 로고
    • Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
    • M. Peeters, Z. Degraeve. Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem, European Journal of Operational Research, 170:416-439, 2006.
    • (2006) European Journal of Operational Research , vol.170 , pp. 416-439
    • Peeters, M.1    Degraeve, Z.2


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