메뉴 건너뛰기




Volumn , Issue , 2000, Pages 175-178

A new encoding scheme for rectangle packing problem

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING SCHEMES; RECTANGLE PACKING; RECTANGLE PACKING PROBLEM; SOLUTION SPACE;

EID: 0013407906     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/368434.368599     Document Type: Conference Paper
Times cited : (12)

References (3)
  • 1
    • 0001363775 scopus 로고
    • Orthogonal Packings in Two Dimensions
    • B. S. Baker, E. G. Coffman, and R. L. Rivest, "Orthogonal Packings in Two Dimensions," SIAM J. Compute., Vol. 9, No. 4 , pp. 846-855, 1980.
    • (1980) SIAM J. Compute. , vol.9 , Issue.4 , pp. 846-855
    • Baker, B.S.1    Coffman, E.G.2    Rivest, R.L.3
  • 3
    • 0003962144 scopus 로고    scopus 로고
    • An Algorithm for Finding a Maximum Weight Decreasing Sequence in a Permutation Motivated by Rectangle Packing Problem
    • T. Takahashi, "An Algorithm for Finding a Maximum Weight Decreasing Sequence in a Permutation Motivated by Rectangle Packing Problem," Technical Report IEICE, Vol. VLD96, No. 201, pp. 31-35, 1996.
    • (1996) Technical Report IEICE , vol.VLD96 , Issue.201 , pp. 31-35
    • Takahashi, T.1


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