Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 강맹규 | - |
dc.date.accessioned | 2021-02-17T05:55:46Z | - |
dc.date.available | 2021-02-17T05:55:46Z | - |
dc.date.issued | 2001-02 | - |
dc.identifier.citation | 한국산업경영시스템학회지, v. 24, no. 62, page. 21-32 | en_US |
dc.identifier.issn | 2287-7975 | - |
dc.identifier.issn | 2005-0461 | - |
dc.identifier.uri | http://db.koreascholar.com/Article?code=22007 | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/158653 | - |
dc.description.abstract | The two-dimensional guillotine cutting problem is to maximize sum of piece profits that cut from one stock rectangle and widely applied in the industry. The branch-and-bound method for this problem uses complementarily several upper bounds(the Gilmore and Gomoryp[8]'s two-dimensional knapsack function and the Hifi and Zissimopoulos[10]'s method using one-dimensional knapsack problem, etc) to reduce the number of searched nodes. These upper bounds has a shortcoming that does not consider the bound and layout of pieces simultaneously. In this paper, we propose an efficient upper bound which can complement the shortcoming of existing upper bounds. The proposed upper bound needs less memory spaces and computing time. Computational results show that the proposed upper bound significantly contribute to reduce the computational amount of time and number of searched nodes in tree. | en_US |
dc.language.iso | ko_KR | en_US |
dc.publisher | 한국산업경영시스템학회 | en_US |
dc.title | 2차원 길로틴 절단 문제를 위한 새로운 상한 | en_US |
dc.title.alternative | A New Upper Bound for Two-Dimensional Guillotine Cutting Problem | en_US |
dc.type | Article | en_US |
dc.relation.journal | 한국산업경영시스템학회지 | - |
dc.contributor.googleauthor | 윤기섭 | - |
dc.contributor.googleauthor | 지영근 | - |
dc.contributor.googleauthor | 강맹규 | - |
dc.relation.code | 2012101506 | - |
dc.sector.campus | E | - |
dc.sector.daehak | COLLEGE OF ENGINEERING SCIENCES[E] | - |
dc.sector.department | DEPARTMENT OF INDUSTRIAL AND MANAGEMENT ENGINEERING | - |
dc.identifier.pid | dockang | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.