A new reformulation approach for the generalized partial covering problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, Y | - |
dc.contributor.author | Sherali, HD | - |
dc.contributor.author | Kwon, I | - |
dc.contributor.author | Kim, S | - |
dc.date.accessioned | 2021-09-09T06:36:17Z | - |
dc.date.available | 2021-09-09T06:36:17Z | - |
dc.date.created | 2021-06-19 | - |
dc.date.issued | 2006-03 | - |
dc.identifier.issn | 0894-069X | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/123151 | - |
dc.description.abstract | In this paper, we consider a situation in which a group of facilities must be constructed in order to serve a given set of customers, where the facilities might not be able to guarantee an absolute coverage to the different customers. We examine the problem of maximizing the total service reliability of the system subject to a budgetary constraint. We propose a new reformulation of this problem that facilitates the generation of tight lower and upper bounds. These bounding mechanisms are embedded within the framework of a branch-and-bound procedure. Computational results on problem instances ranging in size up to 100 facilities and 200 customers reveal the efficacy of the proposed exact and heuristic approaches. (C) 2005 Wiley Periodicals, Inc. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | WILEY | - |
dc.subject | ALGORITHMS | - |
dc.subject | OPTIMIZATION | - |
dc.title | A new reformulation approach for the generalized partial covering problem | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Y | - |
dc.contributor.affiliatedAuthor | Kim, S | - |
dc.identifier.doi | 10.1002/nav.20130 | - |
dc.identifier.scopusid | 2-s2.0-33645011344 | - |
dc.identifier.wosid | 000235534200005 | - |
dc.identifier.bibliographicCitation | NAVAL RESEARCH LOGISTICS, v.53, no.2, pp.170 - 179 | - |
dc.relation.isPartOf | NAVAL RESEARCH LOGISTICS | - |
dc.citation.title | NAVAL RESEARCH LOGISTICS | - |
dc.citation.volume | 53 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 170 | - |
dc.citation.endPage | 179 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordPlus | OPTIMIZATION | - |
dc.subject.keywordAuthor | set covering | - |
dc.subject.keywordAuthor | reformulation | - |
dc.subject.keywordAuthor | air-defense | - |
dc.subject.keywordAuthor | radar site selection | - |
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.