Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 강맹규 | - |
dc.date.accessioned | 2019-11-07T05:46:06Z | - |
dc.date.available | 2019-11-07T05:46:06Z | - |
dc.date.issued | 2005-12 | - |
dc.identifier.citation | 한국경영과학회지, v. 30, No. 4, Page. 61 - 70 | en_US |
dc.identifier.issn | 1225-1119 | - |
dc.identifier.uri | http://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE00660955&language=ko_KR | - |
dc.identifier.uri | https://repository.hanyang.ac.kr/handle/20.500.11754/111973 | - |
dc.description.abstract | In this paper, we develop an improved branch and bound algorithm for the (un)weighted unconstrained two-dimensional cutting problem. In the proposed algorithm, we improve the branching strategies of the existing exact algorithm and reduce the size of problem by removing the dominated pieces from the problem. We apply the newly proposed definition of dominated cutting pattern and it can reduce the number of nodes that must be searched during the algorithm procedure. The efficiency of the proposed algorithm is presented through comparison with the exact algorithm known as the most efficient. | en_US |
dc.language.iso | ko_KR | en_US |
dc.publisher | 한국경영과학회 | en_US |
dc.title | 무제한 2차원 절단문제에 대해 개선된 최적-우선 분지한계 해법 | en_US |
dc.title.alternative | An Improved Best-First Branch and Bound Algorithm for Unconstrained Two-Dimensional Cutting Problems | en_US |
dc.type | Article | en_US |
dc.relation.journal | 한국경영과학회지 | - |
dc.contributor.googleauthor | 윤기섭 | - |
dc.contributor.googleauthor | 방성규 | - |
dc.contributor.googleauthor | 강맹규 | - |
dc.relation.code | 2012101345 | - |
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.