An approach to the solution of the set-covering problem

DOI10.1007/BF01072172zbMath0572.90073MaRDI QIDQ3690585

V. A. Roshchin, Ivan V. Sergienko

Publication date: 1984

Published in: Cybernetics (Search for Journal in Brave)

zbMATH Keywords

convergenceexact solutionset-covering problemmethod of steepest descentadditive algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)

Related Items (1)

Some directions and results of research in mathematical programming and system analysis

Cites Work

• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• Set Covering by an All Integer Algorithm

This page was built for publication: An approach to the solution of the set-covering problem