scientific article; zbMATH DE number 3869064

MaRDI QIDQ3337221zbMATH OpenFDO

Authors G. Hammer

Publication date 1984

zbMATH Keywords

greedy solutionsheuristicsset coveringworst-case bound

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 3863198
• A heuristic algorithm for the multi-criteria set-covering problems
• scientific article; zbMATH DE number 3875302
• Absolute bounds on optimal cost for a class of set covering problems
• A generalization of the weighted set covering problem

Cited in

(4)

• A heuristic algorithm for the multi-criteria set-covering problems
• scientific article; zbMATH DE number 3863198 (Why is no real title available?)
• Absolute bounds on optimal cost for a class of set covering problems
• scientific article; zbMATH DE number 7059774 (Why is no real title available?)

This page was built for publication:

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