메뉴 건너뛰기




Volumn 39, Issue 2, 2012, Pages 200-212

Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing

Author keywords

Column generation; Guillotine cutting; Strip packing; Three dimensional cutting stock; Unbounded knapsack

Indexed keywords

COLUMN GENERATION; GUILLOTINE CUTTING; STRIP PACKING; THREE-DIMENSIONAL CUTTING STOCK; UNBOUNDED KNAPSACK;

EID: 79958165522     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.03.011     Document Type: Article
Times cited : (43)

References (25)
  • 1
    • 0022043635 scopus 로고
    • Algorithms for unconstrained two-dimensional guillotine cutting
    • J.E. Beasley Algorithms for unconstrained two-dimensional guillotine cutting Journal of the Operational Research Society 36 4 1985 297 306 (Pubitemid 15513982)
    • (1985) Journal of the Operational Research Society , vol.36 , Issue.4 , pp. 297-306
    • Beasley, J.E.1
  • 2
    • 0000026164 scopus 로고
    • A recursive computational procedure for two-dimensional stock-cutting
    • J.C. Herz A recursive computational procedure for two-dimensional stock-cutting IBM Journal of Research Development 1972 462 469
    • (1972) IBM Journal of Research Development , pp. 462-469
    • Herz, J.C.1
  • 3
    • 43049089788 scopus 로고    scopus 로고
    • Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
    • DOI 10.1016/j.ejor.2007.08.007, PII S0377221707008831
    • G.F. Cintra, F.K. Miyazawa, Y. Wakabayashi, and E.C. Xavier Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation European Journal of Operational Research 191 2008 59 83 (Pubitemid 351633001)
    • (2008) European Journal of Operational Research , vol.191 , Issue.1 , pp. 59-83
    • Cintra, G.F.1    Miyazawa, F.K.2    Wakabayashi, Y.3    Xavier, E.C.4
  • 5
    • 0001510482 scopus 로고
    • A linear programming approach to the cutting stock problem
    • P. Gilmore, and R. Gomory 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
  • 6
    • 0000143954 scopus 로고
    • A linear programming approach to the cutting stock problem - Part II
    • P. Gilmore, and R. Gomory 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
  • 7
    • 0002662534 scopus 로고
    • Multistage cutting stock problems of two and more dimensions
    • P. Gilmore, and R. Gomory 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
  • 8
    • 0442267313 scopus 로고    scopus 로고
    • A computational study of lp-based heuristic algorithms for two-dimensional guillotine cutting stock problems
    • R. Alvarez-Valdes, A. Parajon, and J.M. Tamarit A computational study of lp-based heuristic algorithms for two-dimensional guillotine cutting stock problems OR Spectrum 24 2 2002 179 192
    • (2002) OR Spectrum , vol.24 , Issue.2 , pp. 179-192
    • Alvarez-Valdes, R.1    Parajon, A.2    Tamarit, J.M.3
  • 9
    • 34447093261 scopus 로고    scopus 로고
    • Models and algorithms for three-stage two-dimensional bin packing
    • DOI 10.1016/j.ejor.2005.11.064, PII S0377221706003067
    • J. Puchinger, and G.R. Raidl Models and algorithms for three-stage two-dimensional bin packing European Journal of Operational Research 183 3 2007 1304 1327 (Pubitemid 47030741)
    • (2007) European Journal of Operational Research , vol.183 , Issue.3 , pp. 1304-1327
    • Puchinger, J.1    Raidl, G.R.2
  • 10
    • 0027576155 scopus 로고
    • On-line algorithm for multidimensional bin packing
    • DOI 10.1016/0167-6377(93)90004-Z
    • J. Csirik, and A. van Vliet An on-line algorithm for multidimensional bin packing Operations Research Letters 13 1993 149 158 (Pubitemid 23710438)
    • (1993) Operations Research Letters , vol.13 , Issue.3 , pp. 149-158
    • Janos, C.1    Andre, V.V.2
  • 13
    • 17744406653 scopus 로고    scopus 로고
    • Near-optimal solution to a two-dimensional cutting stock problem
    • C. Kenyon, and E. Rémila A near-optimal solution to a two-dimensional cutting stock problem Mathematics of Operations Research 25 2000 645 656 (Pubitemid 32135798)
    • (2000) Mathematics of Operations Research , vol.25 , Issue.4 , pp. 645-656
    • Kenyon, C.1    Remila, E.2
  • 15
    • 0032210331 scopus 로고    scopus 로고
    • Exact algorithms for the guillotine strip cutting/packing problem
    • M. Hifi Exact algorithms for the guillotine strip cutting/packing problem Computers & Operations Research 25 1998 925 940
    • (1998) Computers & Operations Research , vol.25 , pp. 925-940
    • Hifi, M.1
  • 17
    • 1442284228 scopus 로고    scopus 로고
    • An exact approach to the strip-packing problem
    • DOI 10.1287/ijoc.15.3.310.16082
    • S. Martello, M. Monaci, and D. Vigo An exact approach to the strip-packing problem INFORMS Journal on Computing 15 3 2003 310 319 (Pubitemid 39042723)
    • (2003) INFORMS Journal on Computing , vol.15 , Issue.3 , pp. 310-319
    • Martello, S.1    Monaci, M.2    Vigo, D.3
  • 18
    • 33244476919 scopus 로고    scopus 로고
    • An asymptotic approximation algorithm for SD-strip packing
    • DOI 10.1145/1109557.1109575, Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms
    • K. Jansen, and R. Solis-Oba An asymptotic approximation algorithm for 3D-strip packing Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms 2006 143 152 (Pubitemid 43275235)
    • (2006) Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms , pp. 143-152
    • Jansen, K.1    Solis-Oba, R.2
  • 20
    • 0009453153 scopus 로고    scopus 로고
    • Equivalence and dominance for problems of optimal packing of rectangles
    • G. Scheithauer Equivalence and dominance for problems of optimal packing of rectangles Ricerca Operativa 27 1997 3 34
    • (1997) Ricerca Operativa , vol.27 , pp. 3-34
    • Scheithauer, G.1
  • 21
    • 73549106809 scopus 로고    scopus 로고
    • An effective recursive partitioning approach for the packing of identical rectangles in a rectangle
    • E.G. Birgin, R.D. Lobato, and R. Morabito An effective recursive partitioning approach for the packing of identical rectangles in a rectangle Journal of the Operational Research Society 61 2010 306 320
    • (2010) Journal of the Operational Research Society , vol.61 , pp. 306-320
    • Birgin, E.G.1    Lobato, R.D.2    Morabito, R.3
  • 23
  • 24
    • 0001392213 scopus 로고
    • Issues in the development of approaches to container loading
    • E.E. Bischoff, and M.S.W. Ratcliff Issues in the development of approaches to container loading OMEGA 23 4 1995 377 390
    • (1995) OMEGA , vol.23 , Issue.4 , pp. 377-390
    • Bischoff, E.E.1    Ratcliff, M.S.W.2
  • 25
    • 79958132794 scopus 로고    scopus 로고
    • Coin-OR CLP. Linear programming solver: an open source code for solving linear programming problems.
    • Coin-OR CLP. Linear programming solver: an open source code for solving linear programming problems. 〈 http://www.coin-or.org/Clp/index.html 〉.


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