A special case of set covering problems

DOI10.1007/BF00429752MaRDI QIDQ1908929zbMATH OpenOpenAlexFDO

Authors M. Reza Emamy-K., A. I. Ramírez

Publication date 5 May 1996

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00429752

zbMATH Keywords

polynomial algorithmset covering problems

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• A New Efficient Heuristic for the Minimum Set Covering Problem
• On the facial structure of the set covering polytope
• An algorithm for set covering problem
• An approach to the solution of the set-covering problem
• An O(m n) algorithm for regular set-covering problems

Cites work

• Graph theory with applications
• scientific article; zbMATH DE number 434690 (Why is no real title available?)
• scientific article; zbMATH DE number 17938 (Why is no real title available?)
• scientific article; zbMATH DE number 19183 (Why is no real title available?)
• scientific article; zbMATH DE number 3561085 (Why is no real title available?)
• Polynomial-time algorithms for regular set-covering and threshold synthesis
• SOME RESULTS ON BUDS, STEMS AND FAULT TOLERANCE IN HYPERCUBES OF DIMENSION ⋚ 5
• Subcube fault-tolerance in hypercubes

Cited in

(4)

• A novel decomposition approach to set covering problems by exploiting special structures
• Set cover problems with small neighborhood covers
• The Exact Subset MultiCover problem
• An algorithm for the difference between set covers

This page was built for publication: A special case of set covering problems

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