Absolute bounds on optimal cost for a class of set covering problems

Absolute bounds on optimal cost for a class of set covering problems

0.00 Avg rating—0 Votes
Article ID: iaor1988804
Country: Germany
Volume: 33
Start Page Number: 181
End Page Number: 192
Publication Date: Feb 1989
Journal: Mathematical Methods of Operations Research (Heidelberg)
Authors: ,
Abstract:

The authors study the class of (m constraint, n variable) set covering problems which have no more than k variables represented in each constraint.

Reviews

Required fields are marked *. Your email address will not be published.