메뉴 건너뛰기




Volumn 88, Issue 1, 1996, Pages 69-87

Stock cutting to minimize cutting length

Author keywords

Approximation scheme; Cutting stock; Dynamic programming; Production

Indexed keywords

ALGEBRA; APPROXIMATION THEORY; CUTTING; DYNAMIC PROGRAMMING; ERRORS; GEOMETRY; OPTIMIZATION;

EID: 0030571686     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00160-X     Document Type: Article
Times cited : (23)

References (12)
  • 1
    • 0022140356 scopus 로고
    • Minimum area circumscribing polygons
    • Aggarwal, A., Chang, J.S., and Yap, C.K., "Minimum area circumscribing polygons", Visual Computer 1 (1985) 112-117.
    • (1985) Visual Computer , vol.1 , pp. 112-117
    • Aggarwal, A.1    Chang, J.S.2    Yap, C.K.3
  • 2
    • 0019087433 scopus 로고
    • A heuristic solution of the rectangular cutting stock problem
    • Albano, A., and Orsini, R., "A heuristic solution of the rectangular cutting stock problem", The Computer Journal 23 (1979) 338-343.
    • (1979) The Computer Journal , vol.23 , pp. 338-343
    • Albano, A.1    Orsini, R.2
  • 3
    • 0021585314 scopus 로고
    • Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
    • Chandrasekaran, R., and Tamir, A., "Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games", Mathematical Programming 30 (1984) 326-339.
    • (1984) Mathematical Programming , vol.30 , pp. 326-339
    • Chandrasekaran, R.1    Tamir, A.2
  • 4
    • 0025385328 scopus 로고
    • Algebraic optimization: The Fermat-Weber location problem
    • Chandrasekaran, R., and Tamir, A., "Algebraic optimization: The Fermat-Weber Location Problem", Mathematical Programming 46 (1990) 219-224.
    • (1990) Mathematical Programming , vol.46 , pp. 219-224
    • Chandrasekaran, R.1    Tamir, A.2
  • 5
    • 0002893433 scopus 로고
    • An algorithm for two dimensional cutting problems
    • Christofides, N., and Whitlock, C., "An algorithm for two dimensional cutting problems", Operations Research 25 (1977) 30-44.
    • (1977) Operations Research , vol.25 , pp. 30-44
    • Christofides, N.1    Whitlock, C.2
  • 6
    • 0020716806 scopus 로고
    • Circumscribing a convex polygon by a polygon of fewer sides with minimum area addition
    • Dori, B., and Ben-Assat, M., "Circumscribing a convex polygon by a polygon of fewer sides with minimum area addition", Computer Vision, Graphics and Image Processing 24 (1983) 131-159.
    • (1983) Computer Vision, Graphics and Image Processing , vol.24 , pp. 131-159
    • Dori, B.1    Ben-Assat, M.2
  • 7
    • 0001510482 scopus 로고
    • A linear programming approach to the cutting stock problem
    • Gilmore, P.C., and Gomory, R.E., "A Linear Programming approach to the Cutting Stock Problem", Operations Research 9/6 (1961) 849-859.
    • (1961) Operations Research , vol.9 , Issue.6 , pp. 849-859
    • Gilmore, P.C.1    Gomory, R.E.2
  • 8
    • 0000143954 scopus 로고
    • A linear programming approach to the cutting stock problem - Part II
    • Gilmore, P.C., and Gomory, R.E., "A Linear Programming approach to the Cutting Stock Problem - Part II", Operations Research 11/6 (1963) 863-888.
    • (1963) Operations Research , vol.11 , Issue.6 , pp. 863-888
    • Gilmore, P.C.1    Gomory, R.E.2
  • 9
    • 0002662534 scopus 로고
    • Multistage cutting stock problems of two and more dimensions
    • Gilmore, P.C., and Gomory, R.E., "Multistage Cutting Stock Problems of two and more dimensions", Operations Research 13/1 (1965) 94-120.
    • (1965) Operations Research , vol.13 , Issue.1 , pp. 94-120
    • Gilmore, P.C.1    Gomory, R.E.2


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