Two methods of ordering the covering elements for the solution of the set covering problem

DOI10.1007/BF01070373zbMATH Open0759.05074OpenAlexW2078167698MaRDI QIDQ4007333

S. V. Murav'Ev

Publication date: 27 September 1992

Published in: Cybernetics (Search for Journal in Brave)

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

zbMATH Keywords

heuristicset covering problemexact algorithmbipartitionminimum weight covering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)

Related Items (2)

A procedure for solution of the problem of optimal covering of a finite set ⋮ The ordered covering problem

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The ordered covering problem 👍 👎
• A procedure for solution of the problem of optimal covering of a finite set 👍 👎
• Problems and algorithms for covering arrays via set covers 👍 👎
• A survey on the problems and algorithms for covering arrays via set covers 👍 👎
• An approach to the solution of the set-covering problem 👍 👎
• New optimal covering arrays using an orderly algorithm 👍 👎
• A Heuristic Method for the Set Covering Problem 👍 👎
• Enumeration technique for set covering problems: a combinatorial approach 👍 👎

This page was built for publication: Two methods of ordering the covering elements for the solution of the set covering problem

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