Branch-and-Cut 알고리즘에서 Lot-Sizing 문제에 대한 Cutting Planes의 전산 성능 연구
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 정광헌 | - |
dc.date.available | 2020-07-10T07:34:30Z | - |
dc.date.created | 2020-07-06 | - |
dc.date.issued | 2015-08 | - |
dc.identifier.issn | 1225-1119 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hongik/handle/2020.sw.hongik/10735 | - |
dc.description.abstract | In this paper, we evaluate the strength of three families of cutting planes for a lot-sizing problem. Lot-sizing problem is very basic MIP model for production planning and many strong valid inequalities have been developed for a variety of relaxations in the literature. To use three families of cutting planes in Branch-and-Cut framework, we develop separation algorithms for each cut and implement them in CPLEX. Then, we perform computational study to compare the effectiveness of three cuts for randomly generated instances of the lot-sizing problem. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | 한국경영과학회 | - |
dc.title | Branch-and-Cut 알고리즘에서 Lot-Sizing 문제에 대한 Cutting Planes의 전산 성능 연구 | - |
dc.title.alternative | Computational Study of Cutting Planes for a Lot-Sizing Problem in Branch-and-Cut Algorithm | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | 정광헌 | - |
dc.identifier.doi | 10.7737/JKORMS.2015.40.3.023 | - |
dc.identifier.bibliographicCitation | 한국경영과학회지, v.40, no.3, pp.23 - 38 | - |
dc.relation.isPartOf | 한국경영과학회지 | - |
dc.citation.title | 한국경영과학회지 | - |
dc.citation.volume | 40 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 23 | - |
dc.citation.endPage | 38 | - |
dc.type.rims | ART | - |
dc.identifier.kciid | ART002024151 | - |
dc.description.journalClass | 2 | - |
dc.description.journalRegisteredClass | kci | - |
dc.subject.keywordAuthor | Mixed-Integer Programming (MIP) | - |
dc.subject.keywordAuthor | Branch-and-Cut | - |
dc.subject.keywordAuthor | Lot-Sizing Problem | - |
dc.subject.keywordAuthor | Separation | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
94, Wausan-ro, Mapo-gu, Seoul, 04066, Korea02-320-1314
COPYRIGHT 2020 HONGIK UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.