Solving hard set covering problems

Solving hard set covering problems

0.00 Avg rating0 Votes
Article ID: iaor19971054
Country: Netherlands
Volume: 18
Issue: 1
Start Page Number: 1
End Page Number: 5
Publication Date: Aug 1995
Journal: Operations Research Letters
Authors: ,
Keywords: set covering
Abstract:

The authors propose a new branch-and-bound algorithm to solve hard instances of set covering problems arising from Steiner triple systems.

Reviews

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