A probabilistic heuristic
for a computationally difficult set covering problem
T.A. Feo and
M.G.C. Resende
Operations Research Letters,
vol. 8, pp. 67-71, 1989.
ABSTRACT
An efficient probabilistic set covering heuristic is presented.
The heuristic is evaluated on empirically difficult to solve set
covering problems that arise from Steiner triple systems. The optimal
solution to only a few of these instances is known. The heuristic
provides these solutions as well as the best known solutions to all
other instances attempted.
PDF file of full paper *
DjVu file of full paper *
Go back
Mauricio G.C. Resende's Home Page
Last modified: 05 March 2003
Copyright Notice
* This material is presented to ensure timely dissemination of
scholarly and technical work. Copyright and all rights therein are
retained by authors or by other copyright holders. All persons copying
this information are expected to adhere to the terms and constraints
invoked by each author's copyright. In most cases, these works may not
be reposted without the explicit permission of the copyright holder.