scientific article; zbMATH DE number 2000148

zbMATH Open1060.90697MaRDI QIDQ4433722FDOQ4433722

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

Publication date: 3 November 2003

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

0,1-matrixstatistically optimal algorithmmatrix covering problem

Mathematics Subject Classification ID

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

Cited In (4)

• Computer Solutions to Minimum-Cover Problems
• 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

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)