A new reformulation approach for the generalized partial covering problem

Youngho Lee, Hanif D. Sherali, Ikhyun Kwon, Seongin Kim

Research output: Contribution to journalArticle

5 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)170-179
Number of pages10
JournalNaval Research Logistics
Volume53
Issue number2
DOIs
Publication statusPublished - 2006 Mar 1

Fingerprint

Covering Problem
Reformulation
Customers
Partial
Branch-and-bound
Computational Results
Efficacy
Upper and Lower Bounds
Coverage
Heuristics

Keywords

  • Air-defense
  • Radar site selection
  • Reformulation
  • Set covering

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

A new reformulation approach for the generalized partial covering problem. / Lee, Youngho; Sherali, Hanif D.; Kwon, Ikhyun; Kim, Seongin.

In: Naval Research Logistics, Vol. 53, No. 2, 01.03.2006, p. 170-179.

Research output: Contribution to journalArticle

Lee, Youngho ; Sherali, Hanif D. ; Kwon, Ikhyun ; Kim, Seongin. / A new reformulation approach for the generalized partial covering problem. In: Naval Research Logistics. 2006 ; Vol. 53, No. 2. pp. 170-179.
@article{c0220e2e08754267bab68164a4d511a9,
title = "A new reformulation approach for the generalized partial covering problem",
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.",
keywords = "Air-defense, Radar site selection, Reformulation, Set covering",
author = "Youngho Lee and Sherali, {Hanif D.} and Ikhyun Kwon and Seongin Kim",
year = "2006",
month = "3",
day = "1",
doi = "10.1002/nav.20130",
language = "English",
volume = "53",
pages = "170--179",
journal = "Naval Research Logistics Quarterly",
issn = "0028-1441",
publisher = "John Wiley and Sons Inc.",
number = "2",

}

TY - JOUR

T1 - A new reformulation approach for the generalized partial covering problem

AU - Lee, Youngho

AU - Sherali, Hanif D.

AU - Kwon, Ikhyun

AU - Kim, Seongin

PY - 2006/3/1

Y1 - 2006/3/1

N2 - 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.

AB - 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.

KW - Air-defense

KW - Radar site selection

KW - Reformulation

KW - Set covering

UR - http://www.scopus.com/inward/record.url?scp=33645011344&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33645011344&partnerID=8YFLogxK

U2 - 10.1002/nav.20130

DO - 10.1002/nav.20130

M3 - Article

VL - 53

SP - 170

EP - 179

JO - Naval Research Logistics Quarterly

JF - Naval Research Logistics Quarterly

SN - 0028-1441

IS - 2

ER -