Clustering heuristics for set covering
type: Item
instance of: scholarly article
title: Clustering heuristics for set covering
zbMATH Open document ID: 0784.90062
DOI: 10.1007/BF02025300
author: Renata Krystyna Kwatera
author: Bruno Simeone
published in: Annals of Operations Research
publication date: 1993-12-20T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 474770
zbMATH Keywords: set covering heuristics
zbMATH Keywords: clustering
MaRDI profile type: Publication
cites work: Q4054519
cites work: On the Set-Covering Problem: II. An Algorithm for Set Partitioning
cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
cites work: Q3037131
cites work: A linear-time approximation algorithm for the weighted vertex cover problem
cites work: Bicriterion Cluster Analysis
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
cites work: Q4148820
cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems
cites work: Q3048571
cites work: Q3760270
cites work: Cluster Analysis: An Application of Lagrangian Relaxation
cites work: P-Complete Approximation Problems
cites work: Q3824115
description: scientific article; zbMATH DE number 474770