Conditional covering: greedy heuristics and computational results

DOI10.1016/0305-0548(87)90053-0zbMath0622.90060MaRDI QIDQ1091265

I. Douglas Moon, S. Thomas McCormick, Sohail S. Chaudhry

Publication date: 1987

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(87)90053-0

zbMATH Keywords

facility location; greedy heuristics; conditional covering; set-covering; worst-case error bounds

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

65K05: Numerical mathematical programming methods

90C90: Applications of mathematical programming

90C10: Integer programming

90C59: Approximation methods and heuristics in mathematical programming

90B05: Inventory, storage, reservoirs

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

An efficient algorithm to solve the conditional covering problem on trapezoid graphs, On conditional covering problem, Efficient algorithms for the conditional covering problem, Heuristic methods and applications: A categorized survey, Facility location on a tree with maximum distance constraints, The conditional covering problem on unweighted interval graphs with nonuniform coverage radius, Optimization in business strategy as a part of sustainable economic growth using clique covering of fuzzy graphs, Covering problem on fuzzy graphs and its application in disaster management system

Cites Work

• Unnamed Item
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• An Analysis of Network Location Problems with Distance Constraints
• A Greedy Heuristic for the Set-Covering Problem
• Worst-Case Analysis of Heuristic Algorithms
• Worst case analysis of a class of set covering heuristics
• Approximating the Performance of Urban Emergency Service Systems
• The Location of Emergency Service Facilities