메뉴 건너뛰기




Volumn 70, Issue 3, 2005, Pages 257-268

Two-dimensional stock cutting and rectangle packing: Binary tree model representation for local search optimization methods

Author keywords

Local optimization search methods; Rectangle packing; Simulated annealing; Stock cutting; Threshold accepting; Trim loss minimization; Two dimensional knapsack problem

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; SIMULATED ANNEALING; TREES (MATHEMATICS);

EID: 17944380647     PISSN: 02608774     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jfoodeng.2003.12.008     Document Type: Article
Times cited : (14)

References (8)
  • 3
    • 25144482720 scopus 로고
    • Threshold accepting a general purpose optimization algorithm appearing superior to simulated annealing
    • G. Dueck, and T. Scheuer Threshold accepting a general purpose optimization algorithm appearing superior to simulated annealing Journal of Computing Physics 90 1990
    • (1990) Journal of Computing Physics , vol.90
    • Dueck, G.1    Scheuer, T.2
  • 7
    • 0009453153 scopus 로고    scopus 로고
    • Equivalence and dominance for problems of optimal packing of rectangles
    • G.S. Scheithauer Equivalence and dominance for problems of optimal packing of rectangles Ricerca Operativa 27 83 1997
    • (1997) Ricerca Operativa , vol.27 , Issue.83
    • Scheithauer, G.S.1


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