What is the best greedy-like heuristic for the weighted set covering problem?

DOI10.1016/j.orl.2016.03.007zbMath1408.90263OpenAlexW2311739387MaRDI QIDQ1790196

Francis J. Vasko, Yun Lu, Kenneth Zyma

Publication date: 2 October 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2016.03.007

zbMATH Keywords

heuristicsgreedy algorithmsweighted set covering problemcolumn knowledge functionsrow knowledge functions

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (3)

Proof of covering minimality by generalizing the notion of independence ⋮ Exploring further advantages in an alternative formulation for the set covering problem ⋮ Column generation extensions of set covering greedy heuristics

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Surrogate constraint normalization for the set covering problem
• An efficient heuristic for large set covering problems
• An empirical study of hybrid genetic algorithms for the set covering problem
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
• A large-scale application of the partial coverage uncapacitated facility location problem

This page was built for publication: What is the best greedy-like heuristic for the weighted set covering problem?