Algorithms for solving the conditional covering problem on paths

Brian J. Lunday, J. Cole Smith, Jeffrey B Goldberg

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear-time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial-time, dynamic programming algorithm to find the optimal solution.

Original languageEnglish (US)
Pages (from-to)293-301
Number of pages9
JournalNaval Research Logistics
Volume52
Issue number4
DOIs
StatePublished - Jun 2005

Fingerprint

Covering Problem
Path
Facility Location
Vary
Covering Radius
Shortest Path Algorithm
Costs
Linear-time Algorithm
Graph in graph theory
Vertex of a graph
Undirected Graph
Dynamic Programming
Polynomial time
Dynamic programming
Optimal Solution
Cover
Graph
Polynomials
Node
Facility location

Keywords

  • Covering problems
  • Dynamic programming
  • Location theory

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

Algorithms for solving the conditional covering problem on paths. / Lunday, Brian J.; Smith, J. Cole; Goldberg, Jeffrey B.

In: Naval Research Logistics, Vol. 52, No. 4, 06.2005, p. 293-301.

Research output: Contribution to journalArticle

Lunday, Brian J. ; Smith, J. Cole ; Goldberg, Jeffrey B. / Algorithms for solving the conditional covering problem on paths. In: Naval Research Logistics. 2005 ; Vol. 52, No. 4. pp. 293-301.
@article{e816037aa66a4caa83dc699797eac6e3,
title = "Algorithms for solving the conditional covering problem on paths",
abstract = "Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear-time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial-time, dynamic programming algorithm to find the optimal solution.",
keywords = "Covering problems, Dynamic programming, Location theory",
author = "Lunday, {Brian J.} and Smith, {J. Cole} and Goldberg, {Jeffrey B}",
year = "2005",
month = "6",
doi = "10.1002/nav.20074",
language = "English (US)",
volume = "52",
pages = "293--301",
journal = "Naval Research Logistics",
issn = "0894-069X",
publisher = "John Wiley and Sons Inc.",
number = "4",

}

TY - JOUR

T1 - Algorithms for solving the conditional covering problem on paths

AU - Lunday, Brian J.

AU - Smith, J. Cole

AU - Goldberg, Jeffrey B

PY - 2005/6

Y1 - 2005/6

N2 - Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear-time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial-time, dynamic programming algorithm to find the optimal solution.

AB - Consider the conditional covering problem on an undirected graph, where each node represents a site that must be covered by a facility, and facilities may only be established at these nodes. Each facility can cover all sites that lie within some common covering radius, except the site at which it is located. Although this problem is difficult to solve on general graphs, there exist special structures on which the problem is easily solvable. In this paper, we consider the special case in which the graph is a simple path. For the case in which facility location costs do not vary based on the site, we derive characteristics of the problem that lead to a linear-time shortest path algorithm for solving the problem. When the facility location costs vary according to the site, we provide a more complex, but still polynomial-time, dynamic programming algorithm to find the optimal solution.

KW - Covering problems

KW - Dynamic programming

KW - Location theory

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

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

U2 - 10.1002/nav.20074

DO - 10.1002/nav.20074

M3 - Article

AN - SCOPUS:18744388857

VL - 52

SP - 293

EP - 301

JO - Naval Research Logistics

JF - Naval Research Logistics

SN - 0894-069X

IS - 4

ER -