Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, Jiwoong | - |
dc.contributor.author | Choi, In-Chan | - |
dc.date.accessioned | 2021-09-05T02:16:02Z | - |
dc.date.available | 2021-09-05T02:16:02Z | - |
dc.date.created | 2021-06-15 | - |
dc.date.issued | 2014-12-02 | - |
dc.identifier.issn | 0020-7160 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/96538 | - |
dc.description.abstract | Redundancy identification techniques play an important role in improving the solvability of a linear program. In this paper, we address the redundancy in multi-dimensional knapsack constraints by proposing a new redundancy identification method. The proposed method is based on the constraint intercepts of Paulraj, Chellappan, and Natesan [A heuristic approach for identification of redundant constraints in linear programming models, Int. J. Comput. Math. 83 (2006), pp. 675-683] and surrogate constraints. In it, feasibility problems are constructed in order to determine the redundancy of the constraints, and are solved by a heuristic algorithm, which is developed to check the redundancy fast. The results of computational experiments show that the proposed method may be used in a preprocessing stage in order to reduce the number of knapsack constraints. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | TAYLOR & FRANCIS LTD | - |
dc.subject | ALGORITHM | - |
dc.subject | SYSTEMS | - |
dc.subject | SEARCH | - |
dc.title | Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Choi, In-Chan | - |
dc.identifier.doi | 10.1080/00207160.2014.885020 | - |
dc.identifier.scopusid | 2-s2.0-84914685428 | - |
dc.identifier.wosid | 000345505700002 | - |
dc.identifier.bibliographicCitation | INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, v.91, no.12, pp.2470 - 2482 | - |
dc.relation.isPartOf | INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | - |
dc.citation.title | INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | - |
dc.citation.volume | 91 | - |
dc.citation.number | 12 | - |
dc.citation.startPage | 2470 | - |
dc.citation.endPage | 2482 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | ALGORITHM | - |
dc.subject.keywordPlus | SYSTEMS | - |
dc.subject.keywordPlus | SEARCH | - |
dc.subject.keywordAuthor | redundancy | - |
dc.subject.keywordAuthor | linear program | - |
dc.subject.keywordAuthor | surrogate constraints | - |
dc.subject.keywordAuthor | knapsack constraints | - |
dc.subject.keywordAuthor | feasibility problems | - |
dc.subject.keywordAuthor | 65K05 | - |
dc.subject.keywordAuthor | 90C08 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
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.