A search algorithm for the minimum cost covering of 0-1 integers sets

DOI10.1016/0045-7825(83)90109-3zbMath0487.65035OpenAlexW2020138874MaRDI QIDQ1165558

N. Ula, A. A. Nouh

Publication date: 1983

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0045-7825(83)90109-3

zbMATH Keywords

convergenceset covering problemcomputational resultsgradient search method

Mathematics Subject Classification ID

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

Related Items (1)

A sequential aggregation algorithm for the set partitioning problem

Cites Work

• Unnamed Item
• Technical Note—Generalized Covering Relaxation for 0-1 Programs
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems

This page was built for publication: A search algorithm for the minimum cost covering of 0-1 integers sets