Partial convexification cuts for 0-1 mixed-integer programs
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sherali, HD | - |
dc.contributor.author | Lee, Y | - |
dc.contributor.author | Kim, Y | - |
dc.date.accessioned | 2021-09-09T06:48:33Z | - |
dc.date.available | 2021-09-09T06:48:33Z | - |
dc.date.created | 2021-06-19 | - |
dc.date.issued | 2005-09-16 | - |
dc.identifier.issn | 0377-2217 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/123218 | - |
dc.description.abstract | In this research, we propose a new cut generation scheme based on constructing a partial convex hull representation for a given 0-1 mixed-integer programming problem by using the reformulation-linearization technique (RLT). We derive a separation problem that projects the extended space of the RLT formulation into the original space, in order to generate a cut that deletes a current fractional solution. Naturally, the success of such a partial convexification based cutting plane scheme depends on the process used to tradeoff the strength of the cut derived and the effort expended. Accordingly, we investigate several variable selection rules for performing this convexification, along with restricted versions of the accompanying separation problems, so as to be able to derive strong cuts within a reasonable effort. We also develop a strengthening procedure that enhances the generated cut by considering the binariness of the remaining unselected 0-1 variables. Finally, we present some promising computational results that provide insights into implementing the proposed cutting plane methodology. (c) 2004 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER | - |
dc.subject | ZERO-ONE | - |
dc.subject | RELAXATIONS | - |
dc.subject | GENERATION | - |
dc.subject | HIERARCHY | - |
dc.title | Partial convexification cuts for 0-1 mixed-integer programs | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Y | - |
dc.identifier.doi | 10.1016/j.ejor.2002.09.002 | - |
dc.identifier.scopusid | 2-s2.0-13444291333 | - |
dc.identifier.wosid | 000228123800007 | - |
dc.identifier.bibliographicCitation | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.165, no.3, pp.625 - 648 | - |
dc.relation.isPartOf | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
dc.citation.title | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | - |
dc.citation.volume | 165 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 625 | - |
dc.citation.endPage | 648 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Business & Economics | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Management | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | ZERO-ONE | - |
dc.subject.keywordPlus | RELAXATIONS | - |
dc.subject.keywordPlus | GENERATION | - |
dc.subject.keywordPlus | HIERARCHY | - |
dc.subject.keywordAuthor | integer programming | - |
dc.subject.keywordAuthor | cutting plane | - |
dc.subject.keywordAuthor | branch-and-cut | - |
dc.subject.keywordAuthor | convexification cut | - |
dc.subject.keywordAuthor | reformulation-linearization technique (RLT) | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
COPYRIGHT © 2021 Korea 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.