Premium
A new reformulation approach for the generalized partial covering problem
Author(s) -
Lee Youngho,
Sherali Hanif D.,
Kwon Ikhyun,
Kim Seongin
Publication year - 2006
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.20130
Subject(s) - bounding overwatch , mathematical optimization , computer science , constraint (computer aided design) , heuristic , set (abstract data type) , branch and bound , reliability (semiconductor) , order (exchange) , upper and lower bounds , operations research , budget constraint , service (business) , mathematics , artificial intelligence , economics , mathematical analysis , power (physics) , physics , geometry , neoclassical economics , economy , finance , quantum mechanics , programming language
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. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006