Algorithms for solving the conditional covering problem on paths

DOI10.1002/nav.20074zbMath1090.90123OpenAlexW2164571740MaRDI QIDQ4680424

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

Publication date: 1 June 2005

Published in: Naval Research Logistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20074

zbMATH Keywords

location theorydynamic programmingcovering problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Discrete location and assignment (90B80)

Related Items (7)

The \(p\)-hub center allocation problem ⋮ Covering problem on fuzzy graphs and its application in disaster management system ⋮ An efficient algorithm to solve the conditional covering problem on trapezoid graphs ⋮ On conditional covering problem ⋮ The conditional covering problem on unweighted interval graphs with nonuniform coverage radius ⋮ Efficient algorithms for the conditional covering problem ⋮ Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs

Cites Work

• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithms for solving the conditional covering problem on paths