Worst case analysis of a class of set covering heuristics

DOI10.1007/BF01583786zbMATH Open0489.90066MaRDI QIDQ3951908FDOQ3951908

Andrew C. Ho

Publication date: 1982

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

set coveringheuristic algorithmsgreedy heuristicworst case bounds

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09)

Cites Work

• Approximation algorithms for combinatorial problems
• A Greedy Heuristic for the Set-Covering Problem
• On the ratio of optimal integral and fractional covers
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• Title not available (Why is that?)

Cited In (6)

• Pareto optimality and a class of set covering heuristics
• Conditional covering: greedy heuristics and computational results
• Heuristic methods and applications: A categorized survey
• Two new heuristics for the location set covering problem
• Using a facility location algorithm to solve large set covering problems
• Dominant, an algorithm for the \(p\)-center problem.

This page was built for publication: Worst case analysis of a class of set covering heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3951908)