scientific article; zbMATH DE number 2000148

zbMATH Open1060.90697MaRDI QIDQ4433722

O. V. German, O. V. Efremov

Publication date: 3 November 2003

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

0,1-matrixstatistically optimal algorithmmatrix covering problem

Mathematics Subject Classification ID

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

Related Items (1)

A Generic Algorithm for Solving Inclusions

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• The generalized maximum coverage problem 👍 👎
• An algorithm for set covering problem 👍 👎
• The Generalized Covering Salesman Problem 👍 👎
• AN ALGORITHMIC FRAMEWORK FOR SOLVING GEOMETRIC COVERING PROBLEMS — WITH APPLICATIONS 👍 👎
• An approximation algorithm for the total covering problem 👍 👎
• An approach to the solution of the set-covering problem 👍 👎
• Some algorithms for solving the covering problem, and their experimental study on a computer 👍 👎
• An exact algorithm for the maximal covering problem 👍 👎

This page was built for publication: