A new worst-case bound of heuristic for set covering problem

MaRDI QIDQ5299159zbMATH OpenFDO

Authors S. Raja Balachandar, K. Kannan, S. K. Ayyaswamy

Publication date 25 June 2013

zbMATH Keywords

computational complexitycombinatorial optimization problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A modified greedy heuristic for the set covering problem with improved worst case bound
• Effective heuristics for the set covering with pairs problem
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• An effective and simple heuristic for the set covering problem
• Worst case analysis of two heuristics for the set partitioning problem

Cited in

(4)

• New heuristic algorithms for the rectangular $p$-cover problem
• Worst case analysis of two heuristics for the set partitioning problem
• New heuristics for the conditional covering problem
• Improved worst-case complexity for the MIN 3-SET COVERING problem

This page was built for publication: A new worst-case bound of heuristic for set covering problem

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