메뉴 건너뛰기




Volumn 37, Issue 6, 2010, Pages 991-1001

Arc-flow model for the two-dimensional guillotine cutting stock problem

Author keywords

Combinatorial optimization; Furniture industry; Guillotine constraints; Integer programming; Two dimensional cutting stock problem

Indexed keywords

FURNITURE INDUSTRY; GUILLOTINE CONSTRAINT; GUILLOTINE CONSTRAINTS; TWO-DIMENSIONAL CUTTING; TWO-DIMENSIONAL CUTTING STOCK PROBLEM;

EID: 71749098494     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2009.08.005     Document Type: Article
Times cited : (89)

References (21)
  • 3
    • 43049089788 scopus 로고    scopus 로고
    • Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
    • Cintra G.F., Miyazawa F.K., Wakabayashi Y., and Xavier E.C. Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. European Journal of Operational Research 191 (2008) 61-85
    • (2008) European Journal of Operational Research , vol.191 , pp. 61-85
    • Cintra, G.F.1    Miyazawa, F.K.2    Wakabayashi, Y.3    Xavier, E.C.4
  • 5
    • 25144476421 scopus 로고    scopus 로고
    • Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
    • Cui Y. Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors. European Journal of Operational Research 169 (2006) 30-40
    • (2006) European Journal of Operational Research , vol.169 , pp. 30-40
    • Cui, Y.1
  • 6
    • 0042094654 scopus 로고    scopus 로고
    • Exact solution of bin-packing problems using column generation and branch-and-bound
    • Valério de Carvalho J.M. Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research 86 (1999) 629-659
    • (1999) Annals of Operations Research , vol.86 , pp. 629-659
    • Valério de Carvalho, J.M.1
  • 10
    • 0003091968 scopus 로고    scopus 로고
    • Cutting and packing: an annotated bibliography
    • Maffioli F., Dell 'Amico M., and Martello S. (Eds), Wiley, New York
    • Dyckhoff H., Scheithauer G., and Terno J. Cutting and packing: an annotated bibliography. In: Maffioli F., Dell 'Amico M., and Martello S. (Eds). Annotated bibliographies in combinatorial optimization (1997), Wiley, New York 393-412
    • (1997) Annotated bibliographies in combinatorial optimization , pp. 393-412
    • Dyckhoff, H.1    Scheithauer, G.2    Terno, J.3
  • 11
    • 0012575285 scopus 로고    scopus 로고
    • New classes of fast lower bounds for bin packing problems
    • Fekete S., and Schepers J. New classes of fast lower bounds for bin packing problems. Mathematical Programming 91 (2001) 11-31
    • (2001) Mathematical Programming , vol.91 , pp. 11-31
    • Fekete, S.1    Schepers, J.2
  • 12
    • 0001510482 scopus 로고
    • A linear programming approach to the cutting stock problem
    • Gilmore P., and Gomory R. A linear programming approach to the cutting stock problem. Operations Research 9 (1961) 849-859
    • (1961) Operations Research , vol.9 , pp. 849-859
    • Gilmore, P.1    Gomory, R.2
  • 13
    • 0000143954 scopus 로고
    • A linear programming approach to the cutting stock problem-Part II
    • Gilmore P., and Gomory R. A linear programming approach to the cutting stock problem-Part II. Operations Research 11 (1963) 863-888
    • (1963) Operations Research , vol.11 , pp. 863-888
    • Gilmore, P.1    Gomory, R.2
  • 14
    • 0002662534 scopus 로고
    • Multistage cutting stock problems of two and more dimensions
    • Gilmore P., and Gomory R. Multistage cutting stock problems of two and more dimensions. Operations Research 13 (1965) 94-120
    • (1965) Operations Research , vol.13 , pp. 94-120
    • Gilmore, P.1    Gomory, R.2
  • 16
    • 84867929689 scopus 로고    scopus 로고
    • Recent advances on two-dimensional bin packing problems
    • Lodi A., Martello S., and Vigo D. Recent advances on two-dimensional bin packing problems. Discrete Applied Mathematics 123 (2002) 379-396
    • (2002) Discrete Applied Mathematics , vol.123 , pp. 379-396
    • Lodi, A.1    Martello, S.2    Vigo, D.3
  • 18
    • 0034156490 scopus 로고    scopus 로고
    • The three-dimensional bin packing problem
    • Martello S., Pisinger D., and Vigo D. The three-dimensional bin packing problem. Operations Research 48 2 (2000) 256-267
    • (2000) Operations Research , vol.48 , Issue.2 , pp. 256-267
    • Martello, S.1    Pisinger, D.2    Vigo, D.3
  • 19
    • 34447093261 scopus 로고    scopus 로고
    • Models and algorithms for three-stage two-dimensional bin packing
    • Puchinger J., and Raidl G. Models and algorithms for three-stage two-dimensional bin packing. European Journal of Operational Research 127 3 (2007) 1304-1327
    • (2007) European Journal of Operational Research , vol.127 , Issue.3 , pp. 1304-1327
    • Puchinger, J.1    Raidl, G.2
  • 20
    • 0035382005 scopus 로고    scopus 로고
    • A nested decomposition approach to a three-stage, two-dimensional cutting stock problem
    • Vanderbeck F. A nested decomposition approach to a three-stage, two-dimensional cutting stock problem. Management Science 47 6 (2001) 864-879
    • (2001) Management Science , vol.47 , Issue.6 , pp. 864-879
    • Vanderbeck, F.1


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