Clustering heuristics for set covering

DOI10.1007/BF02025300zbMath0784.90062MaRDI QIDQ1309879

Bruno Simeone, Renata Krystyna Kwatera

Publication date: 20 December 1993

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

clusteringset covering heuristics

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Surrogate constraint normalization for the set covering problem ⋮ Optimization problems for machine learning: a survey ⋮ On interval and circular-arc covering problems

Cites Work

• A probabilistic heuristic for a computationally difficult set covering problem
• Cluster Analysis: An Application of Lagrangian Relaxation
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• Bicriterion Cluster Analysis
• A linear-time approximation algorithm for the weighted vertex cover problem
• Approximation Algorithms for the Set Covering and Vertex Cover Problems
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• P-Complete Approximation Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Clustering heuristics for set covering