scientific article; zbMATH DE number 2000148

MaRDI QIDQ4433722zbMATH OpenFDO

Authors O. V. German, O. V. Efremov

Publication date 3 November 2003

zbMATH Keywords

0,1-matrixmatrix covering problemstatistically optimal algorithm

Mathematics Subject Classification ID

Boolean programming (90C09) Nonlinear programming (90C30)

Recommendations

• An approximation algorithm for the total covering problem
• An exact algorithm for the maximal covering problem
• An approach to the solution of the set-covering problem
• scientific article; zbMATH DE number 800301
• Some algorithms for solving the covering problem, and their experimental study on a computer
• The generalized maximum coverage problem
• An algorithm for set covering problem
• An algorithmic framework for solving geometric covering problems -- with applications
• scientific article; zbMATH DE number 3863198
• The generalized covering salesman problem

Cited in

(5)

• Resolution principle for the minimum covering problem of a 0-1 matrix
• Minimum ratio cover of matrix columns by extreme rays of its induced cone
• AE1: An extension matrix approximate method for the general covering problem
• A Generic Algorithm for Solving Inclusions
• Computer Solutions to Minimum-Cover 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 Q4433722)