scientific article; zbMATH DE number 3875302

MaRDI QIDQ3342591zbMATH OpenFDO

Authors Xiaoming Li, Richard Van Slyke

Publication date 1984

zbMATH Keywords

multi-covering problemsweighted set-covering

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial aspects of packing and covering (05B40) Algorithms in computer science (68W99)

Recommendations

• A heuristic algorithm for the multi-criteria set-covering problems
• An efficient heuristic for large set covering problems
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• The multicovering problem
• A probabilistic heuristic for a computationally difficult set covering problem

Cited in

(6)

• A fast approximation algorithm for the multicovering problem
• A heuristic algorithm for the multi-criteria set-covering problems
• From valid inequalities to heuristics: A unified view of primal-dual approximation algorithms in covering problems
• scientific article; zbMATH DE number 3869064 (Why is no real title available?)
• Heuristic solutions and confidence intervals for the multicovering problem
• Dynamic programming based algorithms for set multicover and multiset multicover problems

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 Q3342591)