A search algorithm for the minimum cost covering of 0-1 integers sets
type: Item
instance of: scholarly article
title: A search algorithm for the minimum cost covering of 0-1 integers sets
zbMATH Open document ID: 0487.65035
DOI: 10.1016/0045-7825(83)90109-3
author: N. Ula
author: Ali Ahmed Nouh
published in: Computer Methods in Applied Mechanics and Engineering
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 3766966
zbMATH Keywords: convergence
zbMATH Keywords: computational results
zbMATH Keywords: set covering problem
zbMATH Keywords: gradient search method
MaRDI profile type: Publication
full work available at URL: 0045-7825(83)90109-3
OpenAlex ID: W2020138874
cites work: Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
cites work: Q4082544
cites work: Technical Note—Generalized Covering Relaxation for 0-1 Programs
description: scientific article; zbMATH DE number 3766966