Exact and heuristic approaches for the set cover with pairs problem

Exact and heuristic approaches for the set cover with pairs problem

0.00 Avg rating0 Votes
Article ID: iaor20123485
Volume: 6
Issue: 4
Start Page Number: 641
End Page Number: 653
Publication Date: Apr 2012
Journal: Optimization Letters
Authors: , , ,
Keywords: heuristics, sets
Abstract:

This work deals with the set cover with pairs problem (SCPP) which is a generalization of the set cover problem (SCP). In the SCPP the elements have to be covered by specific pairs of objects, instead of a single object. We propose a new mathematical formulation using extended variables that is capable of consistently solve instances with up to 500 elements and 500 objects. We also developed an ILS heuristic which was capable of finding better solutions for several tested instances in less computational time.

Reviews

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