메뉴 건너뛰기




Volumn 54, Issue 4, 2003, Pages 419-425

A distributed global optimization method for packing problems

Author keywords

Cutting stock problem; Distributed computation; Layout; Optimization

Indexed keywords

COMPUTATIONAL GEOMETRY; DISTRIBUTED COMPUTER SYSTEMS; GLOBAL OPTIMIZATION; LINEAR PROGRAMMING; NUMERICAL METHODS;

EID: 0038737157     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601528     Document Type: Article
Times cited : (17)

References (13)
  • 1
    • 0000954920 scopus 로고
    • An approximation algorithm for solving unconstrained two-dimensional knapsack problems
    • Fayard D and Zissimopoulos V (1995). An approximation algorithm for solving unconstrained two-dimensional knapsack problems. Eur J Opl Res 84: 618-632.
    • (1995) Eur J Opl Res , vol.84 , pp. 618-632
    • Fayard, D.1    Zissimopoulos, V.2
  • 2
    • 0030779453 scopus 로고    scopus 로고
    • Best-first search and dynamic programming methods for cutting problems: The cases of one or more stock plates
    • Hifi M and Ouafi R (1997). Best-first search and dynamic programming methods for cutting problems: the cases of one or more stock plates. Comput Ind Eng 32: 187-205.
    • (1997) Comput Ind Eng , vol.32 , pp. 187-205
    • Hifi, M.1    Ouafi, R.2
  • 3
    • 0022013598 scopus 로고
    • An algorithm for the two-dimensional assortment problem
    • Beasley JE (1985). An algorithm for the two-dimensional assortment problem. Eur J Opl Res 19: 253-261.
    • (1985) Eur J Opl Res , vol.19 , pp. 253-261
    • Beasley, J.E.1
  • 4
    • 0031185744 scopus 로고    scopus 로고
    • A three-dimensional pallet loading method for single-size boxes
    • Liu FH and Hsiao CJ (1997). A three-dimensional pallet loading method for single-size boxes. J Opl Res Soc 48: 726-735.
    • (1997) J Opl Res Soc , vol.48 , pp. 726-735
    • Liu, F.H.1    Hsiao, C.J.2
  • 5
    • 0033902714 scopus 로고    scopus 로고
    • An efficient approach for the multi-pallet loading problem
    • Terno J, Scheithauer G, Sommerwei BU and Riehme J (2000). An efficient approach for the multi-pallet loading problem. Eur J Opl Res 123: 372-381.
    • (2000) Eur J Opl Res , vol.123 , pp. 372-381
    • Terno, J.1    Scheithauer, G.2    Sommerwei, B.U.3    Riehme, J.4
  • 6
    • 0012692446 scopus 로고    scopus 로고
    • LP-based bounds for the container and multi-container loading problem
    • Scheithauer G (1999). LP-based bounds for the container and multi-container loading problem. Int Trans Oper Res 6: 199-213.
    • (1999) Int Trans Oper Res , vol.6 , pp. 199-213
    • Scheithauer, G.1
  • 7
    • 0026206767 scopus 로고
    • Three-dimensional packing-solution approaches and heuristic development
    • Dowsland WB (1991). Three-dimensional packing-solution approaches and heuristic development. Int J Prod Res 29: 1673-1685.
    • (1991) Int J Prod Res , vol.29 , pp. 1673-1685
    • Dowsland, W.B.1
  • 8
    • 0034156490 scopus 로고    scopus 로고
    • The three-dimensional bin packing problem
    • Martello S, Pisinger D and Vigo D (2000). The three-dimensional bin packing problem. Oper Res 48: 256-267.
    • (2000) Oper Res , vol.48 , pp. 256-267
    • Martello, S.1    Pisinger, D.2    Vigo, D.3
  • 9
    • 0034675401 scopus 로고    scopus 로고
    • A global optimization algorithm for the three-dimensional packing problem
    • Faina L (2000). A global optimization algorithm for the three-dimensional packing problem. Eur J Opl Res 126: 340-354.
    • (2000) Eur J Opl Res , vol.126 , pp. 340-354
    • Faina, L.1
  • 10
    • 0036722393 scopus 로고    scopus 로고
    • Heuristics for the container loading problem
    • Pisinger D (2002). Heuristics for the container loading problem. Eur J Opl Res 141: 382-392.
    • (2002) Eur J Opl Res , vol.141 , pp. 382-392
    • Pisinger, D.1
  • 11
    • 0029636096 scopus 로고
    • An analytical model for the container loading problem
    • Chen CS, Lee SM and Shen QS (1995). An analytical model for the container loading problem. Eur J Opl Res 80: 68-76.
    • (1995) Eur J Opl Res , vol.80 , pp. 68-76
    • Chen, C.S.1    Lee, S.M.2    Shen, Q.S.3
  • 12
    • 0032027757 scopus 로고    scopus 로고
    • An approximately global optimization method for assortment problems
    • Li HL and Chang CT (1998). An approximately global optimization method for assortment problems. Eur J Opl Res 105: 604-612.
    • (1998) Eur J Opl Res , vol.105 , pp. 604-612
    • Li, H.L.1    Chang, C.T.2


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